{"raw_statement":[{"iden":"statement","content":"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."},{"iden":"input","content":"A single line with a positive integer $k$ ($1 \\leq k \\leq 10\\,000$)."},{"iden":"output","content":"A single number, denoting the $k$\\-th smallest perfect integer."},{"iden":"examples","content":"Input\n\n1\n\nOutput\n\n19\n\nInput\n\n2\n\nOutput\n\n28"},{"iden":"note","content":"The first perfect integer is $19$ and the second one is $28$."}],"translated_statement":[{"iden":"statement","content":"我们称一个正整数为“完美”的，当且仅当它的各位数字之和恰好为 $10$。给定一个正整数 $k$，你的任务是找出第 $k$ 小的完美正整数。\n\n一行包含一个正整数 $k$（$1 lt.eq k lt.eq 10 thin 000$）。\n\n输出一个数，表示第 $k$ 小的完美整数。\n\n第一个完美整数是 $19$，第二个是 $28$。\n\n"},{"iden":"input","content":"一行包含一个正整数 $k$（$1 lt.eq k lt.eq 10 thin 000$）。"},{"iden":"output","content":"输出一个数，表示第 $k$ 小的完美整数。"},{"iden":"examples","content":"输入1输出19输入2输出28"},{"iden":"note","content":"第一个完美整数是 $19$，第二个是 $28$。"}],"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ S = \\{ n \\in \\mathbb{Z}^+ \\mid \\text{sum of digits of } n = 10 \\} $.  \nOrder $ S $ in increasing order: $ s_1 < s_2 < s_3 < \\cdots $.\n\n**Constraints**  \n$ 1 \\leq k \\leq 10{,}000 $\n\n**Objective**  \nFind $ s_k $, the $ k $-th smallest element of $ S $.","simple_statement":null,"has_page_source":false}