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;

public class Main {

    public static boolean triangular(long num) {
        double k = (double) num;
        double r = Math.sqrt(2D * k + 0.25D) - 0.5D;
        double c = (double) (long) r;
        if (c == r) {
            return true;
        }
        return false;
    }

    public static boolean criba(long num) {
        if (num == 1) {
            return false;
        }
        for (long i = 1; i < 100000; i++) {
            long t = i * (i + 1L) / 2L;
            if (t >= num) {
                break;
            }
            if (triangular(num - t)) {
                return true;
            }
        }
        return false;
    }

    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.valueOf(in.readLine());
        System.out.println(criba(n) ? "YES" : "NO");
    }
}