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;

/**
 * Created by saksham on 11-08-2016.
 * 192A
 */
public class FunkyNumbers {
    public static void main(String []args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int num = Integer.parseInt(br.readLine());
        if(num < 2) {
            System.out.println("NO");
            return;
        }
        int[] arr = new int[50000];
        int i = 0, maxIndex = 0;
        arr[0] = 0;
        for(i = 1; arr[i-1] <= num; i++) {
            arr[i] = arr[i-1] + i;
            maxIndex = i;
        }
        maxIndex--;
        while(maxIndex > 0) {
            i = 1;
            while ((arr[i] + arr[maxIndex] <= num) && i <= maxIndex) {
                if (arr[i] + arr[maxIndex] == num) {
                    System.out.println("YES");
                    return;
                }
                i++;
            }
            maxIndex--;
        }
        System.out.println("NO");
    }
}