#include <bits/stdc++.h>
using namespace std;
vector<int> res;
int main() {
  int n;
  cin >> n;
  for (int k1 = 1; (k1 * k1 + k1) <= 2 * n; k1++) res.push_back(k1 * k1 + k1);
  int m = res.size();
  for (int i = 0; i < m; i++) {
    int l = 0, r = m - 1, mid;
    while (r - l > 1) {
      mid = (r + l) / 2;
      if (res[i] + res[mid] > 2 * n)
        r = mid;
      else
        l = mid;
    }
    if (res[i] + res[l] == 2 * n || res[i] + res[r] == 2 * n) {
      cout << "YES" << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}
