#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500005;
const long long INF = 1e18;
int main() {
  long long a, s;
  while (scanf("%I64d", &a) != EOF) {
    long long s = INF / 10;
    s = s * 5 % a;
    s = s * 9 % a;
    s = s * 9 % a;
    s = s * 2 % a;
    long long ans = a - s % a;
    printf("%I64d %I64d\n", ans, INF + ans - 1);
  }
  return 0;
}

### Prompt

Please create a solution in CPP to the following problem:

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 <image>

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 <image>. You are given number a, help Little X to find a proper test for hack.

Input

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

Output

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.

Examples

Input

46


Output

1 10


Input

126444381000032


Output

2333333 2333333333333

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500005;
const long long INF = 1e18;
int main() {
  long long a, s;
  while (scanf("%I64d", &a) != EOF) {
    long long s = INF / 10;
    s = s * 5 % a;
    s = s * 9 % a;
    s = s * 9 % a;
    s = s * 2 % a;
    long long ans = a - s % a;
    printf("%I64d %I64d\n", ans, INF + ans - 1);
  }
  return 0;
}

```