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

	public static void main(String[] args) throws Exception
	{
		new test2().run();
	}

	PrintWriter out = null;

	void run() throws Exception
	{
		Scanner in = new Scanner(System.in);
		out = new PrintWriter(System.out);

		int n = in.nextInt();

		int i = 1;
		int sum = 1;

		HashSet<Integer> hs = new HashSet<Integer>();
		while (sum <= n)
		{
			hs.add(sum);
			i++;
			sum += i;
		}

		boolean f = false;
		Iterator<Integer> it = hs.iterator();
		while (it.hasNext())
		{
			int a = it.next();
			if (hs.contains(n - a))
			{
				f = true;
				break;
			}
		}

		if (f)
			out.println("YES");
		else
			out.println("NO");

		out.close();
	}
}