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;
const long long mod = (1e9 + 7);
long long power(long long n, long long p) {
  long long ans = 1;
  while (p) {
    if (p & 1) {
      ans = (ans * n) % mod;
    }
    p >>= 1;
    n = (n * n) % mod;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n;
  cin >> n;
  for (long long i = 1; i < sqrt(n); i++) {
    long long a = (i * (i + 1)) / 2;
    long long lo = 1, hi = n;
    while (lo <= hi) {
      long long mid = (lo + hi) / 2;
      long long x = (mid * (mid + 1)) / 2;
      if (n == a + x) {
        cout << "YES";
        return 0;
      } else if (a + x > n)
        hi = mid - 1;
      else
        lo = mid + 1;
    }
  }
  cout << "NO";
}