Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Equation

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLet's call a positive integer composite if it has at least one divisor other than $$$1$$$ and itself. For example:

- the following numbers are composite: $$$1024$$$, $$$4$$$, $$$6$$$, $$$9$$$;
- the following numbers are not composite: $$$13$$$, $$$1$$$, $$$2$$$, $$$3$$$, $$$37$$$.

You are given a positive integer $$$n$$$. Find two composite integers $$$a,b$$$ such that $$$a-b=n$$$.

It can be proven that solution always exists.

Input

The input contains one integer $$$n$$$ ($$$1 \leq n \leq 10^7$$$): the given integer.

Output

Print two composite integers $$$a,b$$$ ($$$2 \leq a, b \leq 10^9, a-b=n$$$).

It can be proven, that solution always exists.

If there are several possible solutions, you can print any.

Examples

Input

1

Output

9 8

Input

512

Output

4608 4096

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/02/2021 06:59:31 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|