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
#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 10;
int main() {
  long long n;
  while (~scanf("%I64d", &n)) {
    long long sum1 = 0, sum2 = 0;
    for (int i = 1; i <= 10001; i++) {
      for (int j = 10001; j > i; j--) {
        long long fm = 1LL * i * j;
        long long fz = i + j;
        if (2 * fm - n * fz <= 0) break;
        long long sb = (2 * fm - n * fz);
        long long fuck = (n * fm);
        if (fuck % sb != 0) continue;
        if (i == j || i == fuck / sb || j == fuck / sb) continue;
        if (fuck / sb > 1000000000) continue;
        printf("%d %d %I64d\n", i, j, fuck / sb);
        return 0;
      }
    }
    printf("-1\n");
  }
  return 0;
}
