919 B. Perfect Number

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.

思路：由于时间时2秒，第10000个完美数是10800100，可以暴力

#include<bits/stdc++.h>
using namespace std;
const int N = 10005;
int arr[N];
int cheak(int x){
	int sum=0;
	while(x){
		sum+=x%10;
		x/=10;
		if(sum>10) return 0;
	}
	return sum==10;
}
void init(){
	int k=0;
	for(int i=19;k<=10000;i++)
	   if(cheak(i)) arr[++k]=i;
}
int main(){
	int n;
	init();
	scanf("%d",&n);
	printf("%d\n",arr[n]);
    return 0;
}