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;
string check(long long int n) {
  long long int arr[100000], i, j, y = 0;
  arr[0] = 0;
  for (i = 1;; i++) {
    arr[i] = i * (i + 1) / 2;
    if (arr[i] >= n) break;
  }
  j = i;
  for (long long int i = 1; i < j; i++) {
    if (binary_search(arr + 1, arr + j, n - arr[i])) {
      return "YES";
    }
  }
  return "NO";
}
int main() {
  long long int n;
  cin >> n;
  cout << check(n) << endl;
}