Problem: As you very well know, this year's funkiest numbers are so called triangular numbers (that is, integers that are representable as <image>, where k is some positive integer), and the coolest numbers are those that are representable as a sum of two triangular numbers.

A well-known hipster Andrew adores everything funky and cool but unfortunately, he isn't good at maths. Given number n, help him define whether this number can be represented by a sum of two triangular numbers (not necessarily different)!

Input

The first input line contains an integer n (1 ≤ n ≤ 109).

Output

Print "YES" (without the quotes), if n can be represented as a sum of two triangular numbers, otherwise print "NO" (without the quotes).

Examples

Input

256


Output

YES


Input

512


Output

NO

Note

In the first sample number <image>.

In the second sample number 512 can not be represented as a sum of two triangular numbers.

Solution (in JAVA):

Solution:
import java.util.Scanner;
import java.util.Arrays;
public class Solution {
    public static void main(String args[]) {
        Scanner s=new Scanner(System.in);
        int n=s.nextInt();
        boolean ans=isCoolest(n);
        if(ans)
        {
            System.out.println("YES");
        }
        else System.out.println("NO");
    }
    public static boolean isCoolest(int n)
    {
        long[] arr=new long[100000];
        long sum=0L;
        for(int i=0;i<arr.length;i++)
        {
            sum+=(i+1);
            arr[i]=sum;
        }
        boolean twoSum=twoSum(arr,n);
        return twoSum;
    }
    public static boolean twoSum(long[] arr,int n)
    {
        int start=0,end=arr.length-1;
        while(start<=end)
        {
            if((arr[start]+arr[end])==n)
            {
                return true;
            }
            else if((arr[start]+arr[end])<n)
            {
                start++;
            }
            else{
                end--;
            }
        }
        return false;
    }
}