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;
int main() {
  long long int arr[100001];
  arr[0] = -1;
  for (long long int i = 1; i < 100001; i++) {
    arr[i] = i * (i + 1);
  }
  long long int n;
  cin >> n;
  n = 2 * n;
  long long int flag = 0;
  long long int i = 1;
  while (i != 100001 && arr[i] < n) {
    long long int x = n - arr[i];
    if (binary_search(arr, arr + 100001, x)) {
      flag = 1;
      break;
    }
    i++;
    continue;
  }
  if (flag)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}