#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

int main(){
    int n;
    cin >> n;
    if (n==1){
        cout << 1 << endl;
        return 0;
    }
    for (int i=n-1;i>=0;i--){
        for (int j=0;j<n;j++){
            cout << i;
        }
    }
    cout << endl;
    return 0;
}