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 up[8] = {1, -1, 0, 0, 1, -1, 1, -1};
int dw[8] = {0, 0, 1, -1, -1, 1, 1, -1};
int main() {
  long long n;
  cin >> n;
  set<long long> s;
  set<long long>::iterator it;
  for (long long i = 1; i < 100000; i++) {
    s.insert(i * (i + 1) / 2);
  }
  for (it = s.begin(); it != s.end(); it++) {
    if (s.find(n - (*it)) != s.end()) {
      cout << "YES";
      return 0;
    }
  }
  cout << "NO";
  return 0;
}