CF743C.Vladik and fractions

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Vladik and Chloe decided to determine who of them is better at math. Vladik claimed that for any positive integer $n$ he can represent fraction as a sum of three distinct positive fractions in form .

Help Vladik with that, i.e for a given $n$ find three distinct positive integers $x$ , $y$ and $z$ such that . Because Chloe can't check Vladik's answer if the numbers are large, he asks you to print numbers not exceeding $10^{9}$ .

If there is no such answer, print -1.

输入格式

The single line contains single integer $n$ ( $1<=n<=10^{4}$ ).

输出格式

If the answer exists, print $3$ distinct numbers $x$ , $y$ and $z$ ( $1<=x,y,z<=10^{9}$ , $x≠y$ , $x≠z$ , $y≠z$ ). Otherwise print -1.

If there are multiple answers, print any of them.

输入输出样例

输入#1
```
3
```
输出#1
```
2 7 42
```
输入#2
```
7
```
输出#2
```
7 8 56
```

说明/提示

对于 $100$ %的数据满足 $n \leq 10^4$
要求答案中 $x,y,z \leq 2* 10^{9}$

首页