No tag edit access

B. Perfect Number

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputWe 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.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/20/2018 20:22:34 (d2).

Desktop version, switch to mobile version.

User lists

Name |
---|