A Prosperous Lot

输入一个数 $k$ （$1 <= k <= 10^{6}$ ），输出任意一个每个数位上的数字环之和等于 $k$ 的正整数（要求小于$10^{18}$ ）。如果不存在输出 $-1$ 。 （$0$ 有 $1$ 个环， $1$ 没有环，$2$ 没有环， $3$ 没有环， $4$ 有 $1$ 个环， $5$ 没有环， $6$ 有 $1$ 个环， $7$ 没有环， $8$ 有 $2$ 个环， $9$ 有 $1$ 个环） 感谢@Tweetuzki 提供的翻译

Apart from Nian, there is a daemon named Sui, which terrifies children and causes them to become sick. Parents give their children money wrapped in red packets and put them under the pillow, so that when Sui tries to approach them, it will be driven away by the fairies inside. Big Banban is hesitating over the amount of money to give out. He considers loops to be lucky since it symbolizes unity and harmony. He would like to find a positive integer $ n $ not greater than $ 10^{18} $ , such that there are exactly $ k $ loops in the decimal representation of $ n $ , or determine that such $ n $ does not exist. A loop is a planar area enclosed by lines in the digits' decimal representation written in Arabic numerals. For example, there is one loop in digit $ 4 $ , two loops in $ 8 $ and no loops in $ 5 $ . Refer to the figure below for all exact forms. 

The first and only line contains an integer $ k $ ( $ 1<=k<=10^{6} $ ) — the desired number of loops.

Output an integer — if no such $ n $ exists, output -1; otherwise output any such $ n $ . In the latter case, your output should be a positive decimal integer not exceeding $ 10^{18} $ .

2

462

6

8080