Codeforces Round #384 (Div. 2)-C. Vladik and fractions

原题链接

C. Vladik and fractions

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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

Output

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.

Examples

input

3

output

2 7 42

input

7

output

7 8 56

要想满足2/n = 1/x + 1/y + 1/z,x和y和z不相等,那么存在(a + b + c) / (d * n) = 2 / n所以a = 1, b = n, c = 1+n,d=1+n那么答案就出来了

#include <bits/stdc++.h>
#define maxn 1000005
#define INF 1e9
typedef long long ll;
using namespace std;

int main(){
	
	int n;
	scanf("%d", &n);
	if(n == 1)
	 puts("-1");
	else
	  printf("%d %d %d\n", n, 1+n, n*(1+n));
	return 0;
}