#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll N; cin >> N;
    ll res = 0;
//    for (ll p = 2; ; ++p) {
//        ll cnt = 0;
//        ll R = p*p-1;
//        for (ll a = 0; a < min(p,10LL); ++a) {
//            for (ll b = 0; b < min(p,10LL); ++b) {
//                if(a == b) continue;
//                if(n*(a*p+b) > R) cnt++;
//            }
//        }
//        if(cnt == 0) break;
//        res += cnt;
//    }
    for (ll a = 0; a < 10; ++a) {
        for (ll b = 0; b < 10; ++b) {
            if (a == b) continue;
            ll L = 0, R = 2e9;
            while (R-L>1){
                ll mid = (L+R)/2;
                if(mid*mid-N*a*mid-N*b-1 < 0){
                    L = mid;
                } else{
                    R = mid;
                }
            }
            if(L >= max(a,b))res += L-max(a,b);
        }
    }
    cout << res << endl;
}