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>
int main(void) {
  int n;
  while (~scanf("%d", &n)) {
    int count = 0;
    int a[1000], b[1000];
    int num = 0;
    for (int i = n + 1; i < 2 * n; i++) {
      if ((i * n) % (i - n) == 0) {
        a[++num] = i;
        b[num] = (i * n) / (i - n);
        count++;
        break;
      }
    }
    if (count == 0)
      printf("-1\n");
    else
      printf("%d %d %d\n", n, a[1], b[1]);
  }
  return 0;
}
