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 ans, sum, mn = 1e18, mx, cnt;
long long a[100001], idx;
int main() {
  long long n;
  cin >> n;
  for (long long i = 1; i <= 100000; i++) {
    long long k = i * (i + 1);
    a[idx++] = k / 2;
  }
  long long q = 0;
  for (long long i = 0; i < 90001; i++) {
    if (n >= a[i])
      q = n - a[i];
    else
      break;
    if (binary_search(a, a + 90000, q) == true) {
      cout << "YES";
      return 0;
    }
  }
  cout << "NO";
}