#include<iostream>
using namespace std;
long sq(long C)
{
	long l=0,r=3e9;
	while(r-l>1)
	{
		long mid=(l+r)/2;
		if(mid*mid<C)l=mid;
		else r=mid;
	}
	return l;
}
int main()
{
	long N;
	cin>>N;
	long ans=0;
	for(long a=0;a<=9;a++)for(long b=0;b<=9;b++)if(a!=b)
	{
		long u=sq(N*N*a*a+4*N*b+4);
		//|2p-Na|<=u
		//Na-u<=2p<=Na+u
		//a+1,b+1<=p
		long l=max(N*a-u,4L),r=min(N*a+u,(long)2e9);
		l=(l+1)/2;r=r/2;
		l=max(l,max(a,b)+1);
		if(l<=r)ans+=r-l+1;
	}
	cout<<ans<<endl;
}