#include using namespace std; using ll = long long; #define rep(i,m,n) for(int i=m; i> N; ll ans = 0LL; for(ll x = 1LL; x <= N; ++x){ ll z = N*N - x*x; ll r = ll(2e5 + 10), l = 0LL; while(r != l + 1LL){ ll mid = (r + l)/2LL; if(mid * mid >= z) r = mid; else l = mid; } if(r*r == z){ // cout << x << ' ' << r << endl; ans++; } } cout << ans << endl; return 0; }