{"raw_statement":[{"iden":"problem statement","content":"A positive integer $X$ is said to be a lunlun number if and only if the following condition is satisfied:\n\n*   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$.\n\nFor example, $1234$, $1$, and $334$ are lunlun numbers, while none of $31415$, $119$, or $13579$ is.\nYou are given a positive integer $K$. Find the $K$\\-th smallest lunlun number."},{"iden":"constraints","content":"*   $1 \\leq K \\leq 10^5$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$K$"},{"iden":"sample input 1","content":"15"},{"iden":"sample output 1","content":"23\n\nWe will list the $15$ smallest lunlun numbers in ascending order:  \n$1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$, $11$, $12$, $21$, $22$, $23$.  \nThus, the answer is $23$."},{"iden":"sample input 2","content":"1"},{"iden":"sample output 2","content":"1"},{"iden":"sample input 3","content":"13"},{"iden":"sample output 3","content":"21"},{"iden":"sample input 4","content":"100000"},{"iden":"sample output 4","content":"3234566667\n\nNote that the answer may not fit into the $32$\\-bit signed integer type."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}