Problem5269--ABC161——Task D:Lunlun Number

5269: ABC161——Task D:Lunlun Number

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 256 MiB

Description

A positive integer X is said to be a lunlun number if and only if the following condition is satisfied:
  • In the base ten representation of X (without leading zeros), for every pair of two adjacent digits, the absolute difference of those digits is at most 1.
For example, 1234, 1, and 334 are lunlun numbers, while none of 31415, 119, or 13579 is.
You are given a positive integer K. Find the K-th smallest lunlun number.

Input

Input is given from Standard Input in the following format:
$K$

Output

Print the answer.

Constraints

$1 ≤ K ≤10^5$
All values in input are integers.

Sample 1 Input

15

Sample 1 Output

23
We will list the 15 smallest lunlun numbers in ascending order:
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 21, 22, 23.
Thus, the answer is 23.

HINT

【题目来源】
https://atcoder.jp/contests/abc161/tasks/abc161_d

Source/Category

AtCoder_ABC 100.161.ABC161