/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2022.08.13 07:17:02
**/

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


int main() {
    int n;cin >> n;
    vector<int> a(n+1);
    vector<int> b(n+1,0);
    vector<vector<int>> c(10);
    for (int i = 0; i < n; i++) {
        a[i+1] = b[i+1]+1;
        for (int j = 0; j < c[a[i+1]-1].size(); j++) {
            int k = c[a[i+1]-1][j];
            if (k+i+1 <= n) b[k+i+1] = max(b[k+i+1],a[i+1]);
        }
        c[a[i+1]-1].push_back(i+1);
    }
    for (int i = 0; i < n; i++) {
        cout << a[i+1];
    }
    cout << endl;
    return 0;
}