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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Collections;
import java.util.HashMap;
import java.util.PriorityQueue;
import java.util.Scanner;

public class card_game {
	public static void main(String args[]) throws IOException {
		Scanner scn = new Scanner(System.in);
		long n = scn.nextLong();
		for (int i = 1; i <= (int) Math.sqrt(n); i++) {
			int l = (int) Math.sqrt(n);
			int r = (int) (n);
			while (l<=r) {
				int m = l + (r - l) / 2;
				if ((long)m * (m + 1) / 2 + (long)i * (i + 1) / 2 == n) {
					System.out.println("YES");
					return;
				} else if ((long)m * (m + 1) / 2 + (long)i * (i + 1) / 2 <n) {
					l = m+1;
				} else {
					r = m-1;
				}
			}

		}
//		for (int i = 1;  i<(int)Math.sqrt(n); i++) {
//			for (int j =(int)Math.sqrt(n); j<n; j++) {
//				if ((i * (i + 1) / 2) + (j * (j + 1) / 2) == n) {
//					System.out.println(i);
//					System.out.println(j);
//					System.out.println("YES");
//					return;
//				}
// 
//			}
//		}
		

		System.out.println("NO");
	}
}