#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	ll ans=0;
	ll N,U=10;
	cin>>N;
	rep(p,2,U) rep(a,0,p) rep(b,0,p){
		if(a==b) continue;
		if(N*(p*a+b)>p*p-1) ans++;
	}
	auto f=[](ll a)->ll{
		ll l=0,r=(1<<30);
		while(r-l>1){
			ll med=(r+l)/2;
			if(med*med<=a) l=med;
			else r=med;
		}
		return l;
	};
	rep(a,0,10) rep(b,0,10){
		if(a==b) continue;
		ll A=N*a;
		ll B=N*b+1;
		ll X=A*A+4*B;
		if(X<0) continue;
		ll Y=f(X);
		ll R=(A+Y)/2;
		ll L=(A-Y+1)/2;
		if(Y*Y==X){
			R=(A+Y-1)/2;
			L=(A-Y)/2+1;
		}
		chmax(L,U);
		if(L>R) continue;
		//cout<<a<<" "<<b<<" "<<L<<" "<<R<<" "<<ans<<endl;
		ans+=R-L+1;
	}
	cout<<ans<<"\n";
}