#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};

int main() {
	int n;
	cin >> n;
	int p = __builtin_popcount(n);
	if (p <= 1) cout << -1 << " " << -1 << " " << -1 << endl;
	else {
		int a = n, b = 0, c = 0;
		int cnt = 0;
		rep(i,31) {
			if (n & (1 << i)) {
				if (cnt == 0) b = pow(2,i), cnt++;
				else {
					c = pow(2, i);
					break;
				}
			}
		}
		cout << a << " " << b << " " << c << endl;
	}
}