#include using namespace std; // #include // using namespace atcoder; #define rep(i,n) for (int i = 0; i < (n); ++i) #define rep1(i,n) for (int i = 1; i <= (n); ++i) #define quit(a) {cout << a << endl; return 0;} using ll = long long; using P = pair; // using mint = modint998244353; // using mint = modint1000000007; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } const int INF = 1001001001; const ll LINF = 1002003004005006007ll; int main() { ll n; cin >> n; ll n2 = n*n; ll ans = 0; vector r(n2+1); rep(i,n+1) r[(ll)i*i] = true; r[0] = false; for (int x = 1; x*x <= n2; ++x){ if (x*x >= n2) break; if (r[n2-x*x]) ++ans; } cout << ans << endl; return 0; }