#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N;
    cin >> N;
    string S="";
    vector<char> v;
    for (int i=2; i<=9; i++){
        for (int j=0; j<(1<<(i-1)); j++) v.push_back(i+'0');
    }

    for (int i=0; i<N; i++){
        if (i % 2 == 0) S += '1';
        else S += v[i/2];
    }

    cout << S << endl;

    return 0;
}