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 n;
bool flg;
int main() {
  scanf("%d", &n);
  if (n == 1) {
    puts("NO");
    return 0;
  }
  for (int i = 1; i <= sqrt(n * 2); i++) {
    int a = i * (i + 1) / 2;
    int t = sqrt(2 * (n - a));
    if (a + t * (t + 1) / 2 == n && t != 0) {
      flg = true;
      break;
    }
    if (a + (t + 1) * (t + 2) / 2 == n && t != 0) {
      flg = true;
      break;
    }
  }
  if (flg)
    puts("YES");
  else
    puts("NO");
  return 0;
}