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.ArrayList;
import java.util.Scanner;

public class Solution {

    /**
     * @param args
     */
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        ArrayList<Long> nums = new ArrayList<>();
        for (long i = 1; i <= n; i++) {
            long x = ((i) * (i + 1)) / 2;
            if (x < n) {
                nums.add(x);
            } else {
                break;
            }
        }

//      System.out.println(nums);

        for (int i = 0; i < nums.size(); i++) {
            long current = nums.get(i);
//          System.out.println("---");
//          System.out.println(current);
            int imin = i;
            int imax = nums.size() - 1;
            while (imax >= imin) {
                int imid = imin + ((imax - imin) / 2);
//              System.out.print(current);
//              System.out.print(" + ");
//              System.out.print(nums.get(imid));
//              System.out.print(" = ");
//              System.out.print(current + nums.get(imid));
//              System.out.print(", ");
//              System.out.println(current + nums.get(imid) == n);

                if (current + nums.get(imid) < n) {
                    imin = imid + 1;
                } else if (current + nums.get(imid) > n) {
                    imax = imid - 1;
                } else if (current + nums.get(imid) == n) {
                    System.out.println("YES");
                    return;
                }
            }
        }

        System.out.println("NO");
    }
}