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 is_square(long long x) {
  long long root = sqrt(x);
  return root * root == x;
}
bool solve(long long n) {
  for (long long a = 1; a * (a + 1) <= n; a++) {
    long long disc = 8 * n - 4 * a * a - 4 * a + 1;
    if (is_square(disc)) {
      long long part = sqrt(disc) - 1;
      if (part > 0 && part % 2 == 0) {
        return true;
      }
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  long long n;
  cin >> n;
  if (solve(n)) {
    cout << "YES\n";
  } else {
    cout << "NO\n";
  }
}