#include using namespace std; #define rep(i, a) for (int i = 0; i < (int)(a); i++) #define sz(x) (int)(x).size() #define pcnt __builtin_popcountll typedef long long ll; templateistream& operator>>(istream&i,vector&v){rep(j,sz(v))i>>v[j];return i;} templatestring join(const vector&v){stringstream s;rep(i,sz(v))s<<' '<ostream& operator<<(ostream&o,const vector&v){if(sz(v))o<istream& operator>>(istream&i,pair&v){return i>>v.first>>v.second;} templateostream& operator<<(ostream&o,const pair&v){return o<bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;} templatebool maxs(T& x,const T&y){if(xT dup(T x, T y){return (x+y-1)/y;} templatell suma(const vector&a){ll res(0);for(auto&&x:a)res+=x;return res;} int keta(ll n) { int ret = 0; while (n>0) { n/=10; ret++; } return ret; } #ifdef _DEBUG inline void dump() { cerr << endl; } template void dump(Head &&head) { cerr << head; dump(); } template void dump(Head &&head, Tail &&... tail) { cerr << head << ", "; dump(forward(tail)...); } #define debug(...) do { cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false) #else #define dump(...) #define debug(...) #endif template struct edge { int src, to; T cost; edge(int to, T cost) : src(-1), to(to), cost(cost) {} edge(int src, int to, T cost) : src(src), to(to), cost(cost) {} edge &operator=(const int &x) { to = x; return *this; } operator int() const { return to; } }; template using Edges = vector>; template using WeightedGraph = vector>; using UnWeightedGraph = vector>; const ll LINF = 1LL << 60; const int INF = 1001001001; ///////////////////////////////////////////////////////////////////// void solve() { ll n; cin>>n; n *= n; ll a = 1; set st; while (a*a <= n) { st.insert(a*a); a++; } ll ans = 0; for (auto v:st) { ll t = n-v; if (st.find(t) != st.end()) ans++; } cout << ans << "\n"; } int main() { int t; t = 1; // cin>>t; while (t--) solve(); return 0; }