模拟

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
typedef long long LL;
bool check(int x) {
    string s = to_string(x);
    return s.find('2') != string::npos || s.find('0') != string::npos || s.find('1') != string::npos || s.find('9') != string::npos;
}

int main()
{
    LL ans = 0;
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        if(check(i)) ans += i;
    }
    printf("%lld\n", ans);
    return 0;
}