#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

char pre[10000][10000];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	
	//int N = 4;
	//rep(i, N) {
	//	double pi = acos(-1);
	//	rep(j, i) pi *= 10;

	//	ll k = pi;
	//	ce(k);

	//	vector<pair<int, int>> kotae;
	//	ll kazu = 0;
	//	rep1(i, k) rep1(j, k) {
	//		ll tmp = i * j;

	//		ll cnt = 0;
	//		while (tmp) {
	//			cnt += tmp % 10;
	//			tmp /= 10;
	//		}
	//		if (kazu < cnt) {
	//			kazu = cnt;
	//			kotae.clear();
	//			kotae.pb({ i,j });
	//		}
	//		else if (kazu == cnt) {
	//			kotae.pb({ i,j });
	//		}
	//	}
	//	
	//	rep(z, kotae.size()) cout << kotae[z].first << ' ' << kotae[z].second << endl;
	//}


	int N;
	cin >> N;

	if (N == 0) {
		cosp(9);
		co(1);
	}
	else {
		cosp(N * 18 + 8 );
		co(1);
	}

	Would you please return 0;
}