Hack it!

题意翻译

## 题目描述 小 X 最近遇到了下面的问题。 我们定义函数 $f(x)$ 为 $x$ 的各个数位之和。比如说,$f(1234)=1+2+3+4=10$。任务是,计算 $\sum_{i=l}^rf(i)\operatorname{mod} a$ 的值。 小 X 很快就解决了这个问题。于是小X锁定了这道题,然后开始 hack 别人。他看到了下面这段代码: ```cpp ans = solve(l, r) % a; if (ans <= 0) ans += a; ``` 显而易见地,这段代码会在 $\sum_{i=l}^rf(i)\equiv 0 \pmod a$ 时输出错误。小 X 会告诉你题目中的 $a$ 是多少,现在请你为小 X 构造一个 hack 数据。 ## 输入格式 输入包括一行,即小 X 给定的 $a$ 的值($1\le a\le 10^{18}$) ## 输出格式 输出两个整数:$L,R$,满足 $1\leq L\leq R\leq 10^{200}$,同时 $\sum_{i=l}^rf(i)\equiv 0 \pmod a$,即你构造的 hack 数据。 输入保证有解。 感谢 @mydiplomacy 提供的翻译。

题目描述

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 ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF468C/fe6ab0bba17a510540bf8e106f0f96dce9cb2f34.png) 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: `<br></br> ans = solve(l, r) % a;<br></br> if (ans <= 0)<br></br> ans += a;<br></br><br></br>` This code will fail only on the test with ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF468C/6579a5d2185f1661195234a4c1edbbe014fbef4a.png). You are given number $ a $ , help Little X to find a proper test for hack.

输入输出格式

输入格式


The first line contains a single integer $ a (1<=a<=10^{18}) $ .

输出格式


Print two integers: $ l,r (1<=l<=r&lt;10^{200}) $ — the required test data. Leading zeros aren't allowed. It's guaranteed that the solution exists.

输入输出样例

输入样例 #1

46

输出样例 #1

1 10

输入样例 #2

126444381000032

输出样例 #2

2333333 2333333333333