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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, Scanner in, PrintWriter out) {

            int n = in.nextInt();


            for (int k2 = 1; k2 <= Math.sqrt(2 * n); k2++) {

                int right = (n - (k2 * (k2 + 1)) / 2) * 2;
                int lo = 1, hi = (int) Math.sqrt(right) + 1;
                while (hi - lo > 1) {
                    int mi = lo + (hi - lo) / 2;
                    int sum = mi * (mi + 1);
                    if (sum <= right) {
                        lo = mi;
                    } else hi = mi;
                }

//            System.out.format("k1=%d,k2=%d, right=%d\n", lo, k2, right);

                if (lo * (lo + 1) == right) {
                    out.print("YES");
                    return;
                }
            }

            out.print("NO");
        }

    }
}