#include <iostream>
#include <cmath>
using namespace std;

int main() {
    int n;
    cin >> n;

    // Since i and j should be non-negative (i*i and j*j are non-negative),
    // we only need to check up to the square root of n.
    int maxLimit = sqrt(n);

    for (int i = 0; i <= maxLimit; i++) {
        int jSquared = n - i * i;
        int j = sqrt(jSquared);

        if (j * j == jSquared) {
            cout << "Yes";
            return 0;
        }
    }

    cout << "No";
    return 0;
}