#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cmath>
#include <complex>
#include <cctype>
#include <cassert>
#include <sstream>
#include <ctime>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

#define INF (1<<29)
#define INFL (1ll<<60)
#define EPS (1e-8)
#define PI (acos(-1))
const ll MOD = 1000000007ll;

vector<string> v;

string to_str(ll x) {
	stringstream ss;
	ss << x;
	return ss.str();
}

void make(ll seed) {
	FOR(i, 1, 10) v.push_back(to_str(1000000001ll * seed * i));
	
	//cout << *(v.end() - 1) << endl;
}



int main() {
	ll n;
	cin >> n;
	
	make(1);
	
	bool ng;
	REP(i, 100) {
		FOR(j, 1, 10) {
		 v.push_back(v[(i + 1) * 9 - (9 - (j - 1))]);
		 int now = v.size() - 1;
		 v[now].insert(v[now].begin(), '0' + j);
		 ng = true;
		 for (int k = v[now].size() - 1; k >= 0; k--) {
		 	if (v[now][k] == '0') {
		 		v[now][k] = '0' + j;
		 		ng = false;
		 		break;
		 	}
		 }
		 if (ng) break;
		}
		if (ng) break;
	}
	
	v.erase(v.end());
	
	FOR(i, 2, 9) make(powl(10, i) + 1);
	make(101);
	make(10101);
	make(1010101);
	make(101010101);
	make(10100101);
	make(1001001);
	make(100101001);
	
	int ans = 0;
	REP(i, v.size()) {
		ll now;
		stringstream ss(v[i]);
		ss >> now;
		
		if (n < now) continue;
		ans++;
		
	}
	cout << ans << endl;
	
	return 0;
}