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.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;



public class Funky_Numbers {

    public static void main(String[] args) throws FileNotFoundException {
        // TODO Auto-generated method stub
    //long  num=(new Scanner(new FileInputStream("E:\\Eclipse\\workspace\\Codeforces\\src\\input.txt"))).nextLong();
    long  num=(new Scanner(System.in)).nextLong();
    boolean present= false;
    long p1=(long)Math.sqrt(num),p2,p3,p4;

    for(long i=1;i<=p1;i++)
    {
        
        p2=i*(i+1)/2;
        p3=num-p2;
        if(p3>0)
        {
        p4=(long) Math.sqrt(p3*2);
        if(p4*(p4+1)==2*p3){present=true;break;}
        }

    }
    if(present)System.out.println("YES");
    else System.out.println("NO");
    

    }
    
}