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:
/*   Created by IntelliJ IDEA.
 *   Author: Kunal Srivastav (kunalsrivastav)
 *   Date: 13-07-2021
 *   Time: 20:09
 *   File: FunkyNumbers.java
 */

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;

/**
 * Question - https://codeforces.com/problemset/problem/192/A
 * */

public class FunkyNumbers {
    public static void main(String[] args) throws IOException {
        BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        int n = Integer.parseInt(inp.readLine().trim());
        boolean found = false;
        ArrayList<Integer> arrayList = new ArrayList<>();
        for (int i = 1; (i * (i + 1)) / 2 <= n; i++) {
            arrayList.add((i * (i + 1)) / 2);
        }
        Collections.sort(arrayList);
        for (int i = 0; i < arrayList.size(); i++) {
            int val = n - arrayList.get(i);
            if (Collections.binarySearch(arrayList, val) >= 0) {
                found = true;
                break;
            }
        }
//        if (n == 2) {
//            out.write("YES");
//        } else {
            out.write(found ? "YES" : "NO");
//        }
        out.flush();
    }
}