Codeforces Round #384 (Div. 2) C. Vladik and fractions 構造題

C. Vladik and fractions

題目連結

http://codeforces.com/contest/743/problem/C

題面

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 109.

If there is no such answer, print -1.

輸入

The single line contains single integer n (1 ≤ n ≤ 104).

輸出

If the answer exists, print 3 distinct numbers x, y and z (1 ≤ x, y, z ≤ 109, x ≠ y, x ≠ z, y ≠ z). Otherwise print -1.

If there are multiple answers, print any of them.

樣例輸入

3

樣例輸出

題意

題解

代碼

#include<bits/stdc++.h>
using namespace std;

long long n;
int main()
{
    cin>>n;
    if(n==1)cout<<"-1"<<endl;
    else cout<<n<<" "<<n+1<<" "<<n*(n+1)<<endl;
}