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 s[100000];
bool find(long long x) {
  int l = 1, r = 50000;
  while (l <= r) {
    int mid = (l + r) / 2;
    if (s[mid] == x) return true;
    if (s[mid] < x)
      l = mid + 1;
    else
      r = mid - 1;
  }
  return false;
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < 50000; i++) s[i] = (long long)i * (i + 1) / 2;
  for (int i = 1; s[i] <= n; i++)
    if (find(n - s[i])) {
      puts("YES");
      return 0;
    }
  puts("NO");
}