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


public class CF192A {

    public static void main(String[] args)
    {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();

        // Generate all triangular numbers from 1 to n.
        int[] triangs = new int[(int) Math.ceil(Math.sqrt(2*n))];
        for(int i = 0; i < triangs.length; i++)
        {
            // k = i+1 for triangular number generator because the array is 0 indexed.
            triangs[i] = (i+1) * (i+2) / 2;
            //System.out.println(triangs[i]);
        }
        
        //System.out.println();
        
        int[] originalN = new int[triangs.length];
        for(int i = 0; i < originalN.length; i++)
        {
            originalN[i] = n - triangs[i];
            //System.out.println(originalN[i]);
            //System.out.println(Arrays.binarySearch(triangs, originalN[i]));
            if(0 <= Arrays.binarySearch(triangs, originalN[i]))
            {
                System.out.println("YES");
                System.exit(0);
            }
        }
        System.out.println("NO");
        
    }
}