CF468C.Hack it!

Little X has met the following problem recently.

Let's define f(x) as the sum of digits in decimal representation of number x (for example, f(1234) = 1 + 2 + 3 + 4). You are to calculate

Of course Little X has solved this problem quickly, has locked it, and then has tried to hack others. He has seen the following C++ code:

ans = solve(l, r) % a;
if (ans <= 0)
ans += a;

This code will fail only on the test with . You are given number a, help Little X to find a proper test for hack.

小 X 最近遇到了如下问题：

定义 $ f(x) $ 为十进制表示下数字 $ x $ 的各位数字之和（例如，$ f(1234) = 1 + 2 + 3 + 4 $）。你需要计算

当然，小 X 很快就解决了这个问题，锁定了题目，然后尝试去 hack 其他人的代码。他看到了如下 C++ 代码：

ans = solve(l, r) % a;  
if (ans <= 0)  
    ans += a;  

该代码仅在满足 的测试用例上失败。你将被给定一个数 $ a $，请帮助小 X 找到一个可用于 hack 的合法测试用例。

The first line contains a single integer a (1 ≤ a ≤ 1018).

第一行包含一个整数 $a$（$1 \leq a \leq 10^{18}$）。

Print two integers: l, r (1 ≤ l ≤ r < 10200) — the required test data. Leading zeros aren't allowed. It's guaranteed that the solution exists.

输出两个整数：$l$、$r$（$1 \leq l \leq r < 10^{200}$）—— 所需的测试数据。不允许前导零。保证解存在。