#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll mod = 1e9+7;

/*
3 4 5
20 21 29
119 120 169
4059 4060 5741
137903 137904 195025
4684659 4684660 6625109
a(n) = 3a(n-1) + 2c(n-1) + 1, c(n) = 4a(n-1) + 3c(n-1) + 2
*/

ll x,m=1,ans[3]={},a[100010],c[100010];

struct Xor128{
    unsigned x,y,z,w;
    Xor128():x(123456789),y(362436069),z(521288629),w(88675123){};
    inline unsigned xor128(){
        unsigned t;
        t = x^(x<<11);
        x = y;
        y = z;
        z = w;
        return w = (w^(w>>19))^(t^(t>>8));
    }
    int randInt(int x,int y){//[x,y)
        return xor128()%(y-x)+x;
    }
    double randDouble(double a,double b){//[a,b)
        return (double)(xor128()&0xffff)/0xffff*(b-a)+a;
    }
};
auto rnd=Xor128();

int main(void){
	cin>>x;
	rep(i,x)m*=10;
	a[1]=3;
	c[1]=5;
	if(x==1)cout<<"3 4 5"<<endl;
	reg(i,2,100000){
		a[i]=3*a[i-1]+2*c[i-1]+1;
		c[i]=4*a[i-1]+3*c[i-1]+2;
		if(m/10<=a[i] && a[i]<m && m/10<=a[i]+1 && a[i]+1<m && m/10<=c[i] && c[i]<m){
			cout<<a[i]<<" "<<a[i]+1<<" "<<c[i]<<endl;
			break;
		}
	}
	return 0;
}