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

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    ll n; cin >> n;
    auto sub_solve = [&](int a, int b){
        auto ok = [&](ll p){
            return n*(p*a+b) > p*p-1;
        };
        ll l = max(a, b)+1, r = 1e9;
        if(!ok(l)) return 0ll;
        if(ok(r)){
            return r-max(a, b);
        }
        while(r-l > 1){
            ll p = (l+r)/2;
            if(ok(p)) l = p;
            else r = p;
        }
        ll ans = l-max({a, b, 1});
        return ans;
    };
    ll ans = 0;
    for(int a = 0; a <= 9; a++){
        for(int b = 0; b <= 9; b++){
            if(a == b) continue;
            ans += sub_solve(a, b);
        }
    }
    cout << ans << endl;
}