#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " ";} cout<<endl;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll v[30] = {2, 12, 70, 408, 2378, 13860, 80782, 470832, 2744210, 15994428, 93222358, 543339720, 3166815962, 18457556052, 107578520350, 627013566048, 3654502875938, 21300003689580, 124145519261542, 723573111879672};
    ll v2[30] = {1, 5, 29, 169, 985, 5741, 33461, 195025, 1136689, 6625109, 38613965, 225058681, 1311738121, 7645370045, 44560482149, 259717522849, 1513744654945, 8822750406821, 51422757785981, 299713796309065, 1746860020068409, 10181446324101389, 59341817924539925}; 
    ll X;
    cin >> X;
    rep(i,0,11){
        ll n = v[i];
        ll m = n + sqrt(2*n*n + 1);
        ll c = m*m+n*n;
        if(c >= pow(10,X-1) && c < pow(10,X)){
            cout << 2*m*n << " " << m*m - n*n << " " << m*m+n*n << endl;
            return 0;
        }
    }
    rep(i,0,12){
        ll n = v2[i];
        ll m = n + sqrt(2*n*n - 1);
        ll c = m*m+n*n;
        if(c >= pow(10,X-1) && c < pow(10,X)){
            cout << m*m-n*n << " " << 2*m*n << " " << m*m+n*n << endl;
            return 0;
        }
    }

    // rep(i,1,100001){
    //     ll v = 2*i*i-1;
    //     ll p = sqrt(v);
    //     if(p*p == v){
    //         print(i);
    //     }

    // }
    
}