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.io.*;
import java.math.BigInteger;

public class Tests{
	static Scanner in = new Scanner (System.in);
	static PrintWriter out = new PrintWriter (System.out);

	static TreeSet <Long> set = new TreeSet <Long>();


	public static void main (String []args) {
		int n = in.nextInt();
		
		for(long i = 1 ; i<100000; i++){
			set.add((i*(i+1)/2));
		}
		
		for(long i : set){
			if(set.contains(n-i)) {
				out.println("YES");
				out.flush();
				System.exit(0);
			}
		}
		out.println("NO");
		
		
     
		
	
		
		out.flush();
		out.close();
		
	}
	
	
	

	
}