#include <iostream>
#include <algorithm>
using namespace std;
void dfs(int k,int sz);
bool f(int n);
int N;
int main(){
cout.tie(NULL);
cin.tie(NULL);
ios_base::sync_with_stdio(false);
cin>>N;
dfs(0,0);
}
void dfs(int k,int sz){
if(sz==N)
{
if(f(k)==true)
{
cout<<k<<"\n";
return;
}
else
{
while(f(k)!=true)
{
k++;
}
cout<<k<<"\n";
return;
}
}
while(1)
{
if(f(k)==true)//n이 감소수라면
{
dfs(1+k,1+sz);
return;
}
else
{
k++;
}
}
}
bool f(int n){
int a=-1;
while(n>0)
{
if(n%10<=a)
{
return false;
}
a=n%10;
n=n/10;
}
return true;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwp2b2lkIGRmcyhpbnQgayxpbnQgc3opOwpib29sIGYoaW50IG4pOwppbnQgTjsKaW50IG1haW4oKXsKICAgIGNvdXQudGllKE5VTEwpOwogICAgY2luLnRpZShOVUxMKTsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luPj5OOwogICAgZGZzKDAsMCk7Cn0Kdm9pZCBkZnMoaW50IGssaW50IHN6KXsKICAgIGlmKHN6PT1OKQogICAgewogICAgICAgIGlmKGYoayk9PXRydWUpCiAgICAgICAgewogICAgICAgICAgICBjb3V0PDxrPDwiXG4iOwogICAgICAgICAgICByZXR1cm47CiAgICAgICAgfQogICAgICAgIGVsc2UKICAgICAgICB7CiAgICAgICAgICAgIHdoaWxlKGYoaykhPXRydWUpCiAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIGsrKzsKICAgICAgICAgICAgfQogICAgICAgICAgICBjb3V0PDxrPDwiXG4iOwogICAgICAgICAgICByZXR1cm47CiAgICAgICAgfQogICAgfQogICAgd2hpbGUoMSkKICAgIHsKICAgICAgICBpZihmKGspPT10cnVlKS8vbuydtCDqsJDshozsiJjrnbzrqbQKICAgICAgICB7CiAgICAgICAgICAgIGRmcygxK2ssMStzeik7CiAgICAgICAgICAgIHJldHVybjsKICAgICAgICB9CiAgICAgICAgZWxzZQogICAgICAgIHsKICAgICAgICAgICAgaysrOwogICAgICAgIH0KICAgIH0KfQpib29sIGYoaW50IG4pewogICAgaW50IGE9LTE7CiAgICB3aGlsZShuPjApCiAgICB7CiAgICAgICAgaWYobiUxMDw9YSkKICAgICAgICB7CiAgICAgICAgICAgIHJldHVybiBmYWxzZTsKICAgICAgICB9CiAgICAgICAgYT1uJTEwOwogICAgICAgIG49bi8xMDsKICAgIH0KICAgIHJldHVybiB0cnVlOwp9