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.*;
import java.util.*;
public class codeForces{

	static boolean fun(int p){
		long i,left,right,mid;
		for(i=1;i<Math.sqrt(2*p+1);i++){
			long res = 2*p-(i*(i+1));
			left=1; 
			right=2*p;

			while(left<=right){
				
				mid=(left+right)/2;
				
				long s2=(mid*(mid+1));
				if(s2==res){
					return true;
				}else if(s2>res){
					right=mid-1;
				}else{
					left=mid+1;
				}
			}
		}
		return false;
	}

	public static void main(String args[]){
		int p;
		Scanner sc = new Scanner(System.in);
		p = sc.nextInt();
		boolean res=fun(p);
		if(res)
			System.out.print("YES");
		else
			System.out.print("NO");
	}
}