#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(ll i=0;i> N; if(N%2==1 || N<12){ cout << 0 << endl; return 0; } ll k=N/2; ll c=0; for(ll n=1;2*n*nk) continue; if(gcd(m,n)!=1) continue; c+=k/(m*(m+n)); } } cout << c << endl; return 0; }