write a go solution for 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 Format:
A single line with a positive integer k (1<=k<=10,000).

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

Note:
The first perfect integer is 19 and the second one is 28.. Output only the code with no comments, explanation, or additional text.