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;
long long int a[100005];
long long int find(long long int n) {
  long long int l = 1, r = 100004, mid, ans = -1;
  while (l <= r) {
    mid = (l + r) / 2;
    if (a[mid] == n) {
      ans = 1;
      break;
    } else if (a[mid] > n)
      r = mid - 1;
    else
      l = mid + 1;
  }
  return ans;
}
int main() {
  long long int n, i, f = 0;
  cin >> n;
  for (i = 1; i < 100005; i++) {
    a[i] = a[i - 1] + i;
  }
  for (i = 1; i < 100005; i++) {
    long long int ans = find(n - a[i]);
    if (ans != -1) {
      f = 1;
      break;
    }
  }
  if (f == 1)
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}