#include <bits/stdc++.h>
using namespace std;
using ll=long long;

const int maxn=80;
ll dp[maxn][10][2][2];
string s;
int n;

ll cnt(int pos,int dig,bool tight,bool up){
    if(pos==n)return 1;
    if(dp[pos][dig][tight][up]!=-1)return dp[pos][dig][tight][up];
    ll res=0;
    int lim=tight?s[pos]-'0':9;
    for(int i=0;i<=lim;i++){
        if(i==dig)res+=cnt(pos+1,i,tight&&i==lim,up);
        if(i>dig&&up)res+=cnt(pos+1,i,tight&&i==lim,true);
        if(i>dig&&!up)continue;
        if(i<dig)res+=cnt(pos+1,i,tight&&i==lim,false);
    }
    return dp[pos][dig][tight][up]=res;
}

int main(){
    cin>>s;
    n=s.size();
    memset(dp,-1LL,sizeof dp);
    bool yes=true,up=true;;
    int prev=s[0]-'0';
    for(int i=1;i<n;i++){
        int x=s[i]-'0';
        if(x>prev&&!up)yes=false;
        if(x<prev)up=false;
    }
    cout<<cnt(0,0,true,true)-yes<<'\n';
}