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;
bool binarysrch(vector<int> ar, int beg, int end, int search) {
  int mid;
  while (beg <= end) {
    mid = (beg + end) / 2;
    if (ar[mid] == search) {
      return 1;
    }
    if (search > ar[mid])
      beg = mid + 1;
    else
      end = mid - 1;
  }
  return 0;
}
int main() {
  long long int n, x, i;
  int p;
  cin >> n;
  vector<int> v;
  for (i = 1;; i++) {
    x = (i * (i + 1)) / 2;
    if (x > 1000000000) {
      break;
    } else {
      v.push_back(x);
    }
  }
  int size = v.size();
  for (int j = 0; j < size; j++) {
    p = n - v[j];
    if (binarysrch(v, 0, size - 1, p)) {
      printf("YES\n");
      return 0;
    }
  }
  printf("NO\n");
  return 0;
}