vjudge I - Vladik and fractions a mention pupils.

Link to the original question: https://vjudge.net/contest/331993#problem/I

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

If there is no such answer, print -1.

Input

The single line contains single integer n (1 ≤ n ≤ 10⁴).

Output

If the answer exists, print 3 distinct numbers x, y and z (1 ≤ x, y, z ≤ 10⁹, 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

7856 


In simple terms, for a given n, to build a set of x, y, z, such that 1 / x + 1 / y + 1 / z = 2 / n and n = 1 when the output of -1

#include<bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin>>n;
    if(n==1)  cout<<"-1"<<endl;
    else    cout<<n<<endl<<n+1<<endl<<n*(n+1);
    return 0;
}

 

 

In fact, it can be seen,