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.*;
import java.io.*;
import java.math.*;

public class Main {
	public static Scanner scan = new Scanner(System.in);
	public static boolean bg = true;

	public static void main(String[] args) throws Exception {
		int n1 = Integer.parseInt(scan.next());
		HashSet<Integer> s1 = new HashSet();
		ArrayList<Integer> l1 = new ArrayList();
		for (int i=1;i*(i+1)/2<=1000000000;i++){
			int cur = i*(i+1)/2;
			s1.add(cur);
			l1.add(cur);
		}
		boolean fin = false;
		for (int e: l1){
			if (s1.contains(n1-e)) fin = true;
		}
		if (fin) System.out.println("YES");
		else System.out.println("NO");
		
	}
}