// 
#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

template <typename T>
T expt(T a, T n, T mod = std::numeric_limits<T>::max()){
    T res = 1;
    while(n){
        if(n & 1){res = res * a % mod;}
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

int s[100];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    ll N;
    std::cin >> N;

    ll res = 0ll;
    
    for(int i=1;i<=9;++i){
        int mx = expt(10,(i+1)/2);
        for(int j=mx/10;j<mx;++j){
            if(j % 10 == 0){continue;}
            
            int x = j, idx = 0;
            
            while(x > 0){
                s[idx] = x % 10;
                x /= 10;
                ++idx;
            }

            for(int k=0;k<(i+1)/2;k++){
                s[i-1-k] = s[k];
            }

            for(int k=0;k<i;++k){
                s[i-1-k+9] = s[k];
            }

            auto f = [&s](){
                for(int i=17;i>=0;--i){
                    printf("%d", s[i]);
                }
                puts("");
            };


            ll y = 0ll;
            for(int k=17;k>=0;--k){
                y = y * 10 + s[k];
            }

            if(y <= N){++res;}
            // if(y <= N){
            //     f();
            //     printf("%c\n", "xo"[y<=N]);
            // }
        }
    }

    printf("%lld\n", res);
}