#include <bits/stdc++.h>
using namespace std;
long long x;
long long m;
int main() {
  cin >> m;
  unsigned long long t = 4500;
  for (int i = 1; i <= 99; i++) t = t * 10LL, t %= m;
  t = m - t;
  cout << t << " ";
  t--;
  int cifri = 0;
  long long t1 = t;
  while (t1 != 0) {
    t1 /= 10;
    cifri++;
  }
  if (t == 0) cifri++;
  cout << 1;
  for (int i = 1; i <= 100 - cifri; i++) cout << 0;
  cout << t;
  cout << endl;
}

### Prompt

Please provide a CPP coded solution to the problem described below:

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;
long long x;
long long m;
int main() {
  cin >> m;
  unsigned long long t = 4500;
  for (int i = 1; i <= 99; i++) t = t * 10LL, t %= m;
  t = m - t;
  cout << t << " ";
  t--;
  int cifri = 0;
  long long t1 = t;
  while (t1 != 0) {
    t1 /= 10;
    cifri++;
  }
  if (t == 0) cifri++;
  cout << 1;
  for (int i = 1; i <= 100 - cifri; i++) cout << 0;
  cout << t;
  cout << endl;
}

```