//  Created by conan1024hao in 2019.
//  Copyright © 2019 conan1024hao. All rights reserved.
//  専用ライブラリです、自由にコピーして構いません。
//  感谢看我的代码！Wechat:conan1024hao Twitter/QQ:810396815
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 10e8
#define INF 10e16
#define MOD 1000000007
#define mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
//using Int=int_fast64_t;
typedef long long int ll;
typedef pair<ll,ll>Pll;
typedef pair<int,int>Pin;
long long GCD(long long a, long long b) { return b ? GCD(b, a%b) : a; }
long long LCM(long long a, long long b)  {
    return a/GCD(a,b)*b;
    
}
int dx[8]={-1,0,1,0,1,1,-1,-1};
int dy[8]={0,-1,0,1,1,-1,1,-1};
char dir[4]={'u','l','d','r'};
ll cmp1(pair<ll,string>a,pair<ll,string> b){
        if(a.fi!=b.fi)
        return a.fi<b.fi;
        else
        return a.se<b.se;
}

//---------------------------------------------------------------------------

//---------------------------------------------------------------------------
int main(){//問題をちゃんと見ろ!!!!!!!!!!!!!!!!!      llか??????????统一类型        memset()!!!!!!!!!!!!       ペナを減らせ!!!!!!!!!!!!!
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------
    ll n;cin>>n;
    vector<ll>cnt(10);
    for(int i=1;i<10;i++){
        cnt[i]=9;
        for(int j=2;j<i;j++)
            cnt[i]*=10;
        if(i>=2)cnt[i]*=9;
    }
    ll ans=0;
    string sn=to_string(n);
    ll len=sn.length();

    //cout<<ans<<endl;
    
    
    //a len b<len
    ll x=1,y=1;
    for(ll i=1;i<=len;i++){
        for(ll j=1;j<=len;j++){
            for(x=1;x<=9;x++){
                for(y=1;y<=9;y++){
                    if(i==1||j==1){
                        if(x!=y)continue;
                    }
                    ll c1=1,c2=1;
                    if(i<len){
                        if(i>1){
                            //c1*=x*y;
                            for(int k=0;k<i-2;k++)
                                c1*=10;
                        }
                      
                    }
                    else{
                        
                            //c1*=x*y;
                           //for(int k=0;k<i-2;k++)
                               // c1*=10;
                     
                        if(x==sn[0]-'0'){
                        ll m=pow(10,i-1);//
                  
                            
                        ll use=n-x*m;
                        
                        ll yy=y;
                        ll cnt=0;
                        while(yy<=use){
                            yy+=10;cnt++;
                        }
                            c1+=cnt;c1--;
                        }
                        else if(x<sn[0]-'0'){
                            for(int k=0;k<i-2;k++)
                            c1*=10;
                        }
                        else{
                            c1=0;
                        }
                    }
                    
                    
                    
                    
                    if(j<len){
                      
                            //c2*=x*y;
                            for(int k=0;k<j-2;k++)
                                c2*=10;
                      
                        
                    }
                    else{
                        //if(j>1){
                          //  for(int k=0;k<j-2;k++)
                         //       c2*=10;
                       // }
                        if(y==sn[0]-'0'){
                        ll m=pow(10,j-1);//
                        ll use=n-y*m;
                        ll yy=x;
                        ll cnt=0;
                        
                        while(yy<=use){
                            yy+=10;cnt++;
                        }
                            c2+=cnt;c2--;
                        }
                        else if(y<sn[0]-'0'){
                            for(int k=0;k<j-2;k++)
                            c2*=10;
                        }
                        else{c2=0;}
                       
                    }
                //cout<<i<<" "<<j<<" "<<x<<" "<<y<<" "<<c1<<" "<<c2<<endl;
                    //if(c1*c2!=0)cout<<i<<" "<<j<<" "<<x<<" "<<y<<" "<<c1<<" "<<c2<<endl;
                    ans+=c1*c2;
                }
            }
        }
    }
    
    if(len==1)ans++;
    cout<<ans<<endl;
    //-------------------------------
    return 0;
}
//---------------------------------------------------------------------------






Measured memory_bytes: 256