No tag edit access

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

×
C. Hack it!

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLittle 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:

This code will fail only on the test with . You are given number

ans = solve(l, r) % a;

if (ans <= 0)

ans += a;

Input

The first line contains a single integer *a* (1 ≤ *a* ≤ 10^{18}).

Output

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

Examples

Input

46

Output

1 10

Input

126444381000032

Output

2333333 2333333333333

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/08/2021 22:07:20 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|