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;


public class main {
	public static void main ( String args [] ){
		Scanner input = new Scanner (System.in);
		int  n1 ;
		int n ;
		int sum = 0;
		boolean found = false ;
		n1 = input.nextInt();
		n = n1 * 2 ;
		int k = (int) Math.sqrt(n);
		for(int i = 1 ; i< k ;i++){
			int r = n - ( i * i )- i ;
			int x = (int) Math.sqrt(r);
			if(x * (x + 1) == r){
				found = true ;
				break ;
			}
		}
		if(found){
			System.out.println("YES");
		}
		else{
			System.out.println("NO");
		}
	}
}