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 Main {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		//PrintWriter out = new PrintWriter(System.out);
		int n = Integer.parseInt(br.readLine());
		long sum[] = new long[100000];
		int index = 0;
		for(int i=1;i<100000;i++){
			long s = (i*(i+1))/2;
			if(s<=1000000000)
				sum[index] = s;
			else
				break;
			index++;
		}
		for(int i=0;i<index;i++){
			if(binarySearch(sum,index,n-sum[i])!=-1){
				System.out.println("YES");
				return;
			}
		}
		System.out.println("NO");
		//out.flush();
		//out.close();
		// end of main
	}
	private static int binarySearch(long[] a,int index, long i) {
		int low = 0, high = index - 1;
		while (low <= high) {
			int middle = (high + low) / 2;
			if (a[middle] == i)
				return middle;
			if (a[middle] < i)
				low = middle + 1;
			if (a[middle] > i)
				high = middle - 1;
		}
		return -1;
	}

}