#include <bits/stdc++.h>
using namespace std;
const int N = 25;
int main() {
  unsigned long long a;
  cin >> a;
  unsigned long long t = 1;
  for (int i = 0; i < N; i++) {
    unsigned long long q = t;
    for (int j = 0; j < 9; j++) t = (t + q) % a;
  }
  unsigned long long q = t;
  for (int i = 0; i < N; i++) t = (t + q) % a;
  q = t;
  for (int i = 0; i < 44; i++) t = (t + q) % a;
  t++;
  t %= a;
  cout << a - t + 1 << ' ';
  int c = 0;
  unsigned long long tmp = a - t;
  while (tmp) {
    c++;
    tmp /= 10;
  }
  cout << 1;
  for (int i = 0; i < N + 1 - c; i++) cout << 0;
  cout << a - t;
  return 0;
}

### Prompt

Your challenge is to write 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 int N = 25;
int main() {
  unsigned long long a;
  cin >> a;
  unsigned long long t = 1;
  for (int i = 0; i < N; i++) {
    unsigned long long q = t;
    for (int j = 0; j < 9; j++) t = (t + q) % a;
  }
  unsigned long long q = t;
  for (int i = 0; i < N; i++) t = (t + q) % a;
  q = t;
  for (int i = 0; i < 44; i++) t = (t + q) % a;
  t++;
  t %= a;
  cout << a - t + 1 << ' ';
  int c = 0;
  unsigned long long tmp = a - t;
  while (tmp) {
    c++;
    tmp /= 10;
  }
  cout << 1;
  for (int i = 0; i < N + 1 - c; i++) cout << 0;
  cout << a - t;
  return 0;
}

```