#include <bits/stdc++.h>
using namespace std;
const long long int M = 1e18 + 7;
const long long int mod = 1e9 + 7;
const long long int infi = LLONG_MAX;
long long int i, j, ans, k, n, x, y, m, mymax = LLONG_MIN, mymin = LLONG_MAX, b,
                                        c, z, sum;
int main() {
  scanf("%lld", &n);
  if (n <= 1) {
    printf("%lld\n", (long long int)-1);
  } else {
    x = n;
    y = n + 1;
    z = n * n + n;
    cout << x << ' ' << y << ' ' << z << endl;
  }
  return 0;
}
