#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define mrep(i,n) for(ll i=n;i>=0;--i)
#define all(a) (a).begin(),(a).end()
#define vl vector<ll>
#define vvl vector<vector<ll> >
#define vb vector<bool>
#define vvb vector<vector<bool> >
#define pl pair<ll,ll>
#define inf 1001001001001001000
#define mod 1000000007
//#define mod 998244353
#define pi 3.1415926535
using namespace std;
struct __INIT{
    __INIT(){
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout<<fixed<<setprecision(15);
    }
}__init;

// index が条件を満たすかどうか
bool isOK(ll a,ll index, ll n) {
    return ((n+1)*index)+((n*(n+1))/2) >= a;
}

ll binary_search(ll a,ll key) {
    ll ng = 0;
    ll ok = 1000000000; 

    while (abs(ok - ng) > 1) {
        ll mid = (ok + ng) / 2;

        if (isOK(a,mid, key)) ok = mid;
        else ng = mid;
    }
    return ok;
}

int main(){
    ll a;
    cin>>a;
    ll n = 3;
    bool ok = false;
    while((n*(n+1))/2 <= a){
        if((n*(n+1))/2 == a){
            ok = true;
            break;
        }
        ll m = binary_search(a,n);
        if((n+1)*m+(n*(n+1))/2 == a){
            ok = true;
            break;
        }
        n++;
    }
    if(ok){
        cout<<"YES"<<endl;
    }
    else{
        cout<<"NO"<<endl;
    }
}