← 返回题目

题库练习 The very same Munchhausen

← 上一题下一题 →

A12417 | $The very same Munchhausen$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

A positive integer $a$ is given. Baron Munchausen claims that he knows such a positive integer $n$ that if one multiplies $n$ by $a$ , the sum of its digits decreases $a$ times. In other words, $S(an) = S(n)/a$ , where $S(x)$ denotes the sum of digits of the number $x$ . Find out if what Baron told can be true.

输入格式

The only line contains a single integer $a$ ( $2 \le a \le 10^3$ ).

输出格式

If there is no such number $n$ , print $-1$ . Otherwise print any appropriate positive integer $n$ . Your number must not consist of more than $5\cdot10^5$ digits. We can show that under given constraints either there is no answer, or there is an answer no longer than $5\cdot10^5$ digits.

输入输出样例

输入 #1

输出 #1

输入 #2

输出 #2

输入 #3

输出 #3

-1

C++ 编辑器

输入

输出