#P919B. Perfect Number

    ID: 6414 Type: RemoteJudge 2000ms 256MiB Tried: 0 Accepted: 0 Difficulty: (None) Uploaded By: Tags>binary searchbrute forcedpimplementationnumber theory*1100

Perfect Number

No submission language available for this 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.

A single line with a positive integer $k$ ($1 \leq k \leq 10\,000$).

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

Input

A single line with a positive integer $k$ ($1 \leq k \leq 10\,000$).

Output

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

Samples

1

19

2

28

Note

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