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.Scanner;
import java.lang.Math;
public class A192
	{
	public static void main(String[] args)
		{
		int n=0,i=0,x=0,y=10,count=1;
		Scanner in =new Scanner(System.in);
		n=in.nextInt();
		if(n>1)
			{count=0;
			for(i=1;;i++)
				{
				x=(i*(i+1))/2;
				y=n-x;
				if(x>y)
					{
					if(count==0)	count=1;break;
					}
				else if(x==y||check(2*y))
					{count=2;//System.out.println(x+" "+y);
					System.out.println("YES");System.exit(0);
					}
				else
					{
					continue;
					}
				}
			}
		if(count==1)
			{
			System.out.println("NO");
			}
		}
	public static boolean check(int n)
		{
		double s = Math.sqrt(n);
		double x = Math.ceil(s);
		double y = Math.floor(s);
		if((x*y)==n&&x>y)
			{
			return true;
			}
		return false;
		}
	}