#include <bits/stdc++.h>
using namespace std;
vector<long long> tri(100005);
void solve() {
  long long n;
  cin >> n;
  for (long long i = 1; i < 100005; i++) {
    tri[i] = (i * (i + 1)) / 2LL;
  }
  for (int i = 1; i <= 100000; i++) {
    long long x = n - tri[i];
    if (x <= 0) {
      cout << "NO\n";
      return;
    }
    auto it = lower_bound(tri.begin(), tri.end(), x) - tri.begin();
    if (tri[it] == x) {
      cout << "YES\n";
      return;
    }
  }
  cout << "NO\n";
  return;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
