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.*;
import java.lang.Math;

public class main
{
	public static void main(String args[])
	{
		int n, a,b,k,l,r;
		boolean encontrado=false;
		Scanner myObj = new Scanner(System.in);
		n=myObj.nextInt();

			for(int i=1;i<(int)Math.sqrt(2*n);i++)
			{
				a=i*(i+1)/2;
				l=i;
				r=(int)Math.sqrt(2*n);
				k=(l+r)/2;
				while(l<=r && encontrado==false)
				{
					b=k*(k+1)/2;
					if(a+b<n)
					{
						l=k+1;
						k=(l+r)/2;
					}
					else 
					{
						if(a+b>n)
						{
							r=k-1;
							k=(l+r)/2;
						}
						else
						{
							encontrado=true;	
						}
					}
				}
			}
		
        if(encontrado==false)
        {
			System.out.println("NO");	
		}
		else
			System.out.println("YES");
		
	}
}