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.

Example

Input

1

Output

19

Input

2

Output

28

Note

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

#include<stdio.h>
int main()
{
	long long an[10005];
	int cnt=0,n;
	for(int i=19;cnt<=10000;i++)
	{
		int tmp=i,sum=0;
		while(tmp)
		{
			sum+=tmp%10;
			tmp/=10;
			if(sum>10)
				break;
		}
		if(sum==10)
			an[++cnt]=i;
	}
	while(scanf("%d",&n)!=EOF)
	{
		printf("%lld\n",an[n]);
	}
	return 0; 
}