#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(),greater<int>());
#define INF 999999999
#define MOD 1000000007
#define M_PI 3.14159265358979323846
#define ALL(X) (X).begin(),(X).end()

#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 0};
int dy[]={0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
 
std::string pad(int num){ char buffer[4]; std::snprintf(buffer, sizeof(buffer), "%03d", num); return buffer;}
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

// 愚直に実装したら間に合わないので工夫した。
// 実際はpriority_queueを使えばよかった。
// 以下のは、途中の計算を二分探索で簡略化してる。

ll N;

int top(int n){
  string x=to_string(n);
  return x[0]-48;
}

int bottom(int n){
  string x=to_string(n);
  return x[x.size()-1]-48;
}

int keta(int n){
  string x=to_string(n);
  return x.size();
}

int mid(int n){
  string x=to_string(n);
  string m;
  try{
    m = x.substr(1,x.size()-2);
    return stoi(m);
  }
  catch(...){
      return 0;
  }
}

void input(){
  #ifdef __LOCAL
    fs::path p = __FILE__;
    fs::path input,output;
    input = output = p.parent_path();
    input += string("/input/") + string(p.stem()) + string(".txt");
    output += string("/output/") + string(p.stem()) + string(".txt");
    freopen(input.c_str(), "r", stdin);
    freopen(output.c_str(), "w", stdout);
  #endif
  cin >> N;
}

int solve(){
  input();
  ll ans;
  int cn = top(N);
  int c0 = bottom(N);
  int ck = keta(N);
  int cm = mid(N);

  if(ck==1) {
    cout << N << endl;
    return 0;
    }

  for(int A=1;A<=N;A++){
    if(bottom(A)==0) continue;
    if(ck==2){
      if(bottom(A)*10+top(A) <= N) ans++;
      if(bottom(A)==top(A)) ans++;
      continue;
    }
    
    if(top(A)==bottom(A)) ans++;
    ans += (pow(10,ck-2)-1)/9;
    if(bottom(A)>cn) continue;
    else if(bottom(A)<cn) ans += pow(10,ck-2);
    else{
      if(top(A)<=c0) ans += cm+1;
      else ans += cm;
    }
  }
  cout << ans << endl;
  return 0;
}

int main()
{
  solve();
  return 0;
}


Measured memory_bytes: 256