#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>

#pragma GCC optimize("O2")

using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

int main(void){
	int n,c,a,b,i;
	bool flag = false;

	std::cin >> n; --n;
	c = n/36; n %= 36;
	for(a=1; a<=9; ++a){
		for(b=a+1; b<=9; ++b){
			if(!n){
				flag = true;
				break;
			}
			--n;
		}
		if(flag){
			break;
		}
	}
	std::cout << a;
	for(i=0; i<=c; ++i){
	
		std::cout << b;
	}
	std::cout << std::endl;
	return 0;
}