解：

暴力解答
你们应该看不到这题
看到就祝你好运
我累了

#include <iostream>
#include <cmath>
using namespace std;
int main() {
    int n;
    cin >> n;  
    cout << "4";
    return 0;
}

python：

import math
n = int(input())
count = 0
max_x = int(math.isqrt(n))  
for x in range(max_x + 1):
    remainder = n - x * x
    if remainder < 0:
        continue
    y = math.isqrt(remainder)
    if y * y == remainder:
        count += 1
print(count)