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

public class c121 {

    public static void debug(Object... obs)
    {
        System.out.println(Arrays.deepToString(obs));
    }

    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        
        int n=sc.nextInt();
        
        int sqt = (int)Math.ceil(Math.sqrt(2*n));
        
                
        for(int i=1;i<=sqt;i++)
        {
            long z = 2*n - tg(i);
            if(z <= 0) continue;
            long l=1+4*z;
            long mq=(long)Math.sqrt(l);
            //debug(l,mq,i);
            if(mq*mq == l && (mq-1)%2==0 && mq!=0)
            {
                System.out.println("YES");
                return;
            }
        }
        System.out.println("NO");
        
        
    }

    private static long tg(int i)
    {
        return (i*(i+1));
    }
}