#include #include #include using namespace atcoder; using mint = modint; using namespace std; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf32 1000000001 #define Inf64 2000000000000000005 int main(){ long long n; cin>>n; long long ans = 0; rep(i,10){ rep(j,10){ if(i==j)continue; long long ok = 1,ng = 2000000000; while(ng-ok>1LL){ long long mid = (ok+ng)/2; if((mid*i+j)*n>mid*mid-1)ok = mid; else ng= mid; } long long t = ok - (max(i,j)); if(t>0)ans += t; } } cout<