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.ArrayList;
import java.util.HashSet;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		ArrayList<Long> l = new ArrayList<Long>();
		for (long k = 1; k <= 44720; k++)
			l.add(k * (k + 1) / 2);
		HashSet<Long> set = new HashSet<Long>(l);
		
		int n = new Scanner(System.in).nextInt();
		for(int i = 0; i < l.size() && l.get(i) < n; i++)
			if(set.contains(n - l.get(i))){
				System.out.println("YES");
				System.exit(0);
			}
		System.out.println("NO");
	}
}