E - Perfect Number

Problem description

We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.

Input

A single line with a positive integer k (1 ≤ k ≤ 10 000).

Output

A single number, denoting the k-th smallest perfect integer.

Examples

Input

1

Output

19

Input

2

Output

28

Note

The first perfect integer is 19 and the second one is 28.

解题思路：题目的意思就是找出升序序列（每个数的每位数字总和都为10）中第k个数。暴力水过！

AC代码：

 #include <bits/stdc++.h>
 using namespace std;
 int main()
 {
     int n,k=,tmp,sum,obj[];bool flag;
     for(int i=;k<;++i){
         tmp=i;sum=;flag=false;
         while(!flag && tmp){
             if(sum>=)flag=true;//如果sum超过10就无需再比较下去了,因为此时的i一定不满足要求
             sum+=tmp%;
             tmp/=;
         }
         if(!flag && sum==)obj[k++]=i;
     }
     cin>>n;
     cout<<obj[n-]<<endl;
     return ;
 }