#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
int mat[2][2] = { {3,4},{2,3} };
void matmul(int A[2][2],int B[2][2]) {
	int X[2][2];
	int Y[2][2];
	for (int i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			X[i][j] = A[i][j];
			Y[i][j] = B[i][j];
		}
	}
	for (int i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			A[i][j] = 0;
			for (int k = 0; k < 2; k++) {
				A[i][j] += X[i][k] * Y[k][j];
			}
		}
	}

}
void matpow(int A[2][2], int p) {
	if (p == 1)return;
	int X[2][2];

	for (int i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			X[i][j] = A[i][j];
		}
	}
	matpow(A, p / 2);

	matmul(A, A);
	
	if (p % 2 == 1) {
		matmul(A, X);
	}


}
int keta(int a) {
	int res = 0;
	while (a > 0) {
		res++;
		a /= 10;
	}
	return res;
}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N; cin >> N;

	int T[2][2];

	for (int i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			T[i][j] = mat[i][j];
		}
	}
	int k = 1;
	while (true) {
		
		k++;
		//if (k > 20)break;

		//cerr << T[1][0] + T[1][1] << endl;
		if (keta(T[1][0] + T[1][1]) == N) {
			int a = (T[0][0] + T[0][1] - 1) / 2;
			int c = T[1][0] + T[1][1];
			cout << a << " " << a + 1 << " " << c << endl;
			break;
		}
		matmul(T, mat);
	}
}