#include <bits/stdc++.h>
using namespace std;
int cas = 1;
int dxx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dyy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int dx[] = {-1, 0, 0, 1};
int dy[] = {0, -1, 1, 0};
struct node {
  int x, y;
  bool operator<(const node& p) const { return x < p.x; }
};
int main() {
  int n;
  scanf("%d", &n);
  if (n == 1) {
    printf("-1\n");
  } else {
    printf("%d %d %d\n", n, n + 1, n * (n + 1));
  }
  return 0;
}
