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 a[45000];
int bsearch(int* A, int x, int y, int v) {
  int m;
  while (x < y) {
    m = x + (y - x) / 2;
    if (A[m] == v)
      return m;
    else if (A[m] > v)
      y = m;
    else
      x = m + 1;
  }
  return -1;
}
bool find(int x) {
  int res = bsearch(a, 0, 45000, x);
  if (res != -1)
    return 1;
  else
    return 0;
}
int main() {
  int i, n, t, flag;
  for (i = 0; i < 45000; i++) {
    a[i] = (i + 1) * (i + 2) / 2;
  }
  while (~scanf("%d", &n)) {
    flag = 0;
    for (i = 0; a[i] <= n / 2; i++) {
      t = n - a[i];
      if (find(t)) {
        flag = 1;
        break;
      }
    }
    if (flag)
      puts("YES");
    else
      puts("NO");
  }
}