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.*;


public class funkynumbers {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub

    Scanner scan=new Scanner(System.in);
    long k=scan.nextInt();
    
    
    for(int i=1;i<=50000;i++)
    {
        long n=2*k-i*(i+1);
        long low=0,high=50000,mid=(low+high)/2;
        if(n>0)
        {
            while(low<high && low!=high-1)
            {
                if(mid*(mid+1)<n)
                    low=mid;
                if(mid*(mid+1)>n)
                    high=mid;
                if(mid*(mid+1)==n)
                {
                    System.out.println("YES");
                    System.exit(0);
                }
                mid=(low+high)/2;
            }
        }
        else 
            break;
    }   
    
System.out.println("NO");
}

}