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 int MOD = 1e9 + 7;
const int MAX = 100010;
long long int gcd(long long int a, long long int b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * gcd(a, b)) / b;
}
long long int modexpo(long long int a, long long int b) {
  long long int x = 1, y = a;
  while (b > 0) {
    if (b & 1) x = (x * y) % MOD;
    y = (y * y) % MOD;
    b >>= 1;
  }
  return x;
}
long long int a[MAX];
int main() {
  long long int n;
  cin >> n;
  for (long long int i = 1; i <= 100000; i++) a[i] = i * 1LL * (i + 1) / 2;
  for (int i = 1, _n = (100000); i < _n; ++i) {
    int id = lower_bound(a + 1, a + 100001, n - a[i]) - a;
    if (a[id] + a[i] == n) {
      puts("YES");
      return 0;
    }
  }
  puts("NO");
  return 0;
}