def is_prime(n):
for i in range(2, int(n / 2)):
if (n % i) == 0:
return False
return True
n = int(input())
i = 4
while True:
if not is_prime(i) and not is_prime(i+n):
print(i+n, i)
break
i += 1
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long int ll;
int main()
{
//freopen("in.txt", "r", stdin);
ll n; cin >> n;
ll m = n; n*=8;
cout << n+m << " " << n << endl;
return 0;
}
1173B - Nauuo and Chess | 318B - Strings of Power |
1625A - Ancient Civilization | 864A - Fair Game |
1663B - Mike's Sequence | 448A - Rewards |
1622A - Construct a Rectangle | 1620A - Equal or Not Equal |
1517A - Sum of 2050 | 620A - Professor GukiZ's Robot |
1342A - Road To Zero | 1520A - Do Not Be Distracted |
352A - Jeff and Digits | 1327A - Sum of Odd Integers |
1276A - As Simple as One and Two | 812C - Sagheer and Nubian Market |
272A - Dima and Friends | 1352C - K-th Not Divisible by n |
545C - Woodcutters | 1528B - Kavi on Pairing Duty |
339B - Xenia and Ringroad | 189A - Cut Ribbon |
1182A - Filling Shapes | 82A - Double Cola |
45A - Codecraft III | 1242A - Tile Painting |
1663E - Are You Safe | 1663D - Is it rated - 3 |
1311A - Add Odd or Subtract Even | 977F - Consecutive Subsequence |