#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
#include<tuple>
using namespace std;
/*
 typedef unsigned long long int ull;
 typedef long long int ll;
 */
typedef unsigned long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;

ll cnt(ll a){
    ll cnt=0;
    while(a>0){
        a/=10;
        cnt++;
    }
    return cnt;
}


int main(){
    vector<ll> A={3,20,119};
    vector<ll> B={5,29,169};
    ll x;
    cin>>x;
    while(cnt(B[0])<x){
        B[0]=B[1];
        B[1]=B[2];
        B[2]=B[1]*6-B[0];
        A[0]=A[1];
        A[1]=A[2];
        A[2]=A[1]*6-A[0]+2;
    }
    cout<<A[0]<<" "<<A[0]+1<<" "<<B[0]<<endl;
    
    return 0;
}