#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<ctime>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<map>
using namespace std;
typedef long long LL;
const int MR=1e6+10;
LL n,ans;
LL sq(LL x){
    LL l=0,r=2e9;
    while(l+1<r){
        LL m=(l+r)/2;
        if(m*m<=x) l=m;
        else r=m;
    }
    return l;
}
int main(){
    cin>>n;
    for(LL p=2;p<10;p++){
        for(LL a=0;a<p;a++){
            for(LL b=0;b<p;b++){
                if(a==b) continue;
                if(a*p*n+b*n>p*p-1) ans++;
            }
        }
    }
    for(LL a=0;a<10;a++){
        for(LL b=0;b<10;b++){
            if(a==b) continue;
            LL D=n*n*a*a+4*n*b+4;
            LL rd=sq(D);
            LL tmp=n*a+rd;
            //printf("a=%lld b=%lld D=%lld rd=%lld tmp=%lld\n",a,b,D,rd,tmp);
            if(tmp%2){
                ans+=max(0ll,tmp/2-9);
            }
            else{
                if(rd*rd==D) ans+=max(0ll,tmp/2-10);
                else ans+=max(0ll,tmp/2-9);
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}