#include <iostream>
#include <cmath>
 
int count_pairs(int n) {
    int count = 0;
    int sqrt_n = std::sqrt(n);
    for (int x = 1; x <= sqrt_n; x++) {
        int y = sqrt_n * sqrt_n - x * x;
        int sqrt_y = std::sqrt(y);
        if (sqrt_y * sqrt_y == y && x + sqrt_y == sqrt_n) {
            count++;
        }
    }
    return count;
}
 
int main() {
    int n;
    std::cin >> n;
    std::cout <<  count_pairs(n) << std::endl;
    return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y21hdGg+CgppbnQgY291bnRfcGFpcnMoaW50IG4pIHsKICAgIGludCBjb3VudCA9IDA7CiAgICBpbnQgc3FydF9uID0gc3RkOjpzcXJ0KG4pOwogICAgZm9yIChpbnQgeCA9IDE7IHggPD0gc3FydF9uOyB4KyspIHsKICAgICAgICBpbnQgeSA9IHNxcnRfbiAqIHNxcnRfbiAtIHggKiB4OwogICAgICAgIGludCBzcXJ0X3kgPSBzdGQ6OnNxcnQoeSk7CiAgICAgICAgaWYgKHNxcnRfeSAqIHNxcnRfeSA9PSB5ICYmIHggKyBzcXJ0X3kgPT0gc3FydF9uKSB7CiAgICAgICAgICAgIGNvdW50Kys7CiAgICAgICAgfQogICAgfQogICAgcmV0dXJuIGNvdW50Owp9CgppbnQgbWFpbigpIHsKICAgIGludCBuOwogICAgc3RkOjpjaW4gPj4gbjsKICAgIHN0ZDo6Y291dCA8PCAgY291bnRfcGFpcnMobikgPDwgc3RkOjplbmRsOwogICAgcmV0dXJuIDA7Cn0=

MjU=

25