|Codeforces Round #609 (Div. 2)|
Let's call a positive integer composite if it has at least one divisor other than $$$1$$$ and itself. For example:
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.
The input contains one integer $$$n$$$ ($$$1 \leq n \leq 10^7$$$): the given integer.
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.