#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T sqr(T a) {
  return a * a;
};
const double pi = acos(-1.0);
const int INF = 1e9;
const int MAX_N = 1e9;
long long N, x, y, z;
bool check(long long x, long long y, long long z) {
  return (x != y && y != z && x != z && x <= INF && y <= INF && z <= INF);
}
int main(int argc, char const *argv[]) {
  cin >> N;
  x = N;
  y = (N + 1);
  z = N * (N + 1);
  if (check(x, y, z))
    cout << x << " " << y << " " << z << endl;
  else
    cout << "-1" << endl;
  return 0;
}

### Prompt

Your challenge is to write a Cpp solution to the following problem:

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 <image> as a sum of three distinct positive fractions in form <image>.

Help Vladik with that, i.e for a given n find three distinct positive integers x, y and z such that <image>. 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T sqr(T a) {
  return a * a;
};
const double pi = acos(-1.0);
const int INF = 1e9;
const int MAX_N = 1e9;
long long N, x, y, z;
bool check(long long x, long long y, long long z) {
  return (x != y && y != z && x != z && x <= INF && y <= INF && z <= INF);
}
int main(int argc, char const *argv[]) {
  cin >> N;
  x = N;
  y = (N + 1);
  z = N * (N + 1);
  if (check(x, y, z))
    cout << x << " " << y << " " << z << endl;
  else
    cout << "-1" << endl;
  return 0;
}

```