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

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define pb push_back
#define m0(x) memset(x,0,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<int,int>
#define pllll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<int,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, int>>
#define vpsll vector<pair<string, ll>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};

#define int long long

string judge(string s) {
    int n = (int)s.size();
    rep(i, n) {
        repi(j, i+1, n) {
            if(s[i] == s[j] && i+j < n) {
                if(s[i] >= s[i+j]) {
                    return "No";
                }
            }
        }
    }
    FOR(n-1) if(s[i] == s[i+1]) return "No";
    return "Yes";
}

void solve() {
    int n;
    cin >> n;

    random_device rnd;
    srand((int)time(0));
    mt19937 rng(rnd() * rand());

    bool flag = true;
    string now = "";
    
    auto dfs = [&](char p, auto self) -> void {
        if(!flag) return;
        now.push_back(p);

        if(now.size() == n) {
            if(judge(now) == "Yes") {
                cout << now << endl;
                flag = false;
            }
            now.pop_back();
            return;
        }

        rep(i, 30) {
            char c = (char)(rng()%9+1+'0');
            if(c != p) self(c, self);
        }

        now.pop_back();
    };

    for(char c = '1'; c <= '9'; c++) dfs(c, dfs);
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}