#include <bits/stdc++.h>

using namespace std;

int main() {
    int N;
    cin >> N;

    vector X(N + 1, 0);

    X[1] = 1;

    for (int i = 2; i <= N; i++) {
        int m = 0;
        for (int j = 1; j < i - j; j++) {
            if (X[j] == X[i - j]) {
                m = max(X[j], m);
            }
        }
        X[i] = m + 1;
        if (X[i - 1] == X[i]) ++X[i];
    }

    for (int i = 1; i <= N; i++) cout << X[i];
    cout << endl;

    return 0;
}