//
// Created by tamas on 9/8/23.
//

#include "bits/stdc++.h"
using namespace std;

string s;
int r = 0;

struct vmi {
    bool found_max;
    int val;
    int index;
    bool thing;
    bool operator<(const vmi& a) const {
        if (found_max != a.found_max)
            return found_max < a.found_max;
        if (val != a.val)
            return val < a.val;
        if (index != a.index)
            return index < a.index;
        if (thing != a.thing)
            return thing < a.thing;
        return false;
    }
};

map<vmi, int> cache;

void f(vmi& dolog) {
    if (cache.count(dolog)) {
        r += cache[dolog];
        return;
    }
    bool found_max  = dolog.found_max;
    int  val        = dolog.val;
    int  index      = dolog.index;
    bool thing      = dolog.thing;
    if (index == s.size()) {
        r++;
        return;
    }
    int num = s[index] - '0';
    int old_r = r;
    if (found_max) {
        int m  = thing ? val : min(num, val);
        for (int i = 0; i <= m; i++) {
            vmi v = (vmi){true, i, index + 1, (thing || (i < num))};
            f(v);
        }
    }
    else {
        int m = thing ? 9 : num;
        for (int i = 0; i <= m; i++) {
            vmi v = (vmi){i < val, i, index+1, (thing || (i < num))};
            f(v);
        }
    }
    if (!cache.count(dolog)) {
        cache.emplace(dolog, r - old_r);
    }
}

bool az() {
    bool f;
    int last = s[0] - '0';
    for (int i = 1; i < s.size(); i++) {
        int c = s[i] - '0';
        if (c - '0' < last) {
            f = true;
        }
        else if (c - '0' > last && f)
            return false;
    }
    return true;
}

int main() {
    cin >> s;
    vmi v = (vmi){false, 0, 0, false};
    f(v);
    cout << r-az();
}