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.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Round121A {
	private static final int LOCAL_ENV = 1;

	static Set<Integer> funks;

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		try {
			if (LOCAL_ENV == 1) {
				in = new Scanner(new File("input.txt"));
			}
		} catch (FileNotFoundException e) {
		}
		int n = in.nextInt();
		funks = new HashSet<Integer>();
		for (int i = 1; ; i++) {
			long z = (i);
			z = z * (i+1) / 2;
			if (z > n) {
				break;
			}
			funks.add((int) z);
		}
		boolean ans = false;
		for (int v : funks) {
			if (funks.contains(n - v)) {
				ans = true;
				break;
			}
		}
		System.out.println(ans ? "YES" : "NO");
	}
}