#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <algorithm>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <string>
#include <math.h>
using namespace std;

bool rcmp(int a, int b) { return a>b; }
typedef long long LL;



int gcd(int a, int b) {
    int t;
    while(a) { t=a; a=b%a; b=t; }
    return b;
}
int main() {
    LL n, i, g;
    LL v, vv, nv, b=1000000;
    b*=b;
    scanf("%lld", &v);
    for (i=0; i<1000000; i++) {
        nv=(v-i*i+b)%b;
        // (i*2*x*1000000+i*i)%1000000000000 = v;
        g = 2000000*gcd(i, 500000);
        if ((nv%g)==0) break;
    }
    if (i<1000000) printf("YES\n"); else printf("NO\n");
    return 0;
}