#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	// int m = 3141;
	// auto f = [](int i) {
	// 	int res = 0;
	// 	while (i > 0) res += i % 10, i /= 10;
	// 	return res;
	// };
	// int ans = 0, ansc = 0;
	// FOR(i, 1, m + 1) FOR(j, i, m + 1) {
	// 	printf("%2d %2d = %3d (%6d)\n", i, j, i * j, f(i * j));
	// 	if (chmax(ans, f(i * j))) ansc = 1;
	// 	else if (ans == f(i * j)) ++ansc;
	// }
	// cout << "ans = " << ans << endl;
	// cout << "ansc = " << ansc << endl;
	int N;
	cin >> N;
	if (N == 0) puts("9 1");
	else printf("%d 1\n", 8 + 9 * (2 * N));
}

/*
29 31 899
299 301 89999
2999 3001 8999999
*/