#include <bits/stdc++.h>
using namespace std;
const long long BIAS = 1e18;
long long Mo;
long long g[20], e[20];
void step() {
  e[0] = 1;
  for (int i = 1; i <= 18; i++) e[i] = e[i - 1] * 10 % Mo;
  g[1] = 45 % Mo;
  for (int i = 2; i <= 18; i++)
    g[i] = (g[i - 1] * 10 % Mo + e[i - 1] * g[1] % Mo) % Mo;
}
int main() {
  cin >> Mo;
  step();
  long long d = (Mo - g[18] - 1) % Mo;
  cout << d + 1 << ' ' << d + BIAS << endl;
  return 0;
}

### Prompt

Your task is to create a cpp solution 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 long long BIAS = 1e18;
long long Mo;
long long g[20], e[20];
void step() {
  e[0] = 1;
  for (int i = 1; i <= 18; i++) e[i] = e[i - 1] * 10 % Mo;
  g[1] = 45 % Mo;
  for (int i = 2; i <= 18; i++)
    g[i] = (g[i - 1] * 10 % Mo + e[i - 1] * g[1] % Mo) % Mo;
}
int main() {
  cin >> Mo;
  step();
  long long d = (Mo - g[18] - 1) % Mo;
  cout << d + 1 << ' ' << d + BIAS << endl;
  return 0;
}

```