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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int INF = 1e9;
int const N = 5e4 + 16;
int const M = 1e9 + 7;
int const M2 = 999999983;
int n;
int main() {
  scanf("%d", &n);
  bool found = false;
  for (int i = 1; i < 44722; ++i) {
    long long t1 = i * (i + 1) / 2;
    if (t1 > n) break;
    int l = i + 1, r = 44722;
    while (l < r) {
      int m = (l + r) / 2;
      int t2 = m * (m + 1) / 2;
      if (t1 + t2 <= n)
        l = m + 1;
      else
        r = m;
    }
    if (t1 + l * (l - 1) / 2 == n || n == t1 + t1) {
      found = true;
      break;
    }
  }
  puts(found ? "YES" : "NO");
}