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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author zodiacLeo
 */
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
    {
        int[] funky = new int[44720];

        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            long n = in.nextLong();
            int index = 0;
            for (long i = 1; ; i++)
            {
                long num = i * (i + 1) / 2;
                if (num > 1e9)
                {
                    break;
                }
                funky[index++] = (int) num;
            }


            for (int i = 0; i < funky.length; i++)
            {
                int j = Arrays.binarySearch(funky, (int) (n - funky[i]));
                if (j >= 0 && j < funky.length)
                {
                    out.println("YES");
                    return;
                }
            }
            out.println("NO");
        }

    }
}