#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, ans=0;
    cin >> N;

    for (int p=2; p<=9; p++){
        for (int a=0; a<=p-1; a++){
            for (int b=0; b<=p-1; b++){
                if (a == b) continue;
                if (p*p-N*a*p-1<N*b) ans++;
            }
        }
    }

    for (int a=0; a<=9; a++){
        for (int b=0; b<=9; b++){
            if (a == b) continue;
            ll l=0, r=1e9+1, c;
            while(r-l>1){
                c = (l+r)/2;
                if (N*b>c*c-N*a*c-1) l=c;
                else r=c;
            }
            ans += max(0LL, l-9);
        }
    }

    cout << ans << endl;

    return 0;
}