#include <bits/stdc++.h>
using namespace std;
unsigned long long f[21], g[21], P;
int main() {
  scanf("%I64u", &P);
  f[1] = 45;
  g[1] = 1;
  for (int i = 2; i <= 19; i++) {
    g[i] = (g[i - 1] * 10) % P;
    f[i] = (f[i - 1] * 10 + g[i] * 45) % P;
  }
  f[19] = (f[19] + 1) % P;
  long long tmp = P - f[19];
  if (f[19])
    printf("%I64u %I64u\n", tmp + 1, tmp + (unsigned long long)1e19);
  else
    printf("1 %I64u\n", (unsigned long long)1e19);
}

### Prompt

In cpp, your task is to solve 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;
unsigned long long f[21], g[21], P;
int main() {
  scanf("%I64u", &P);
  f[1] = 45;
  g[1] = 1;
  for (int i = 2; i <= 19; i++) {
    g[i] = (g[i - 1] * 10) % P;
    f[i] = (f[i - 1] * 10 + g[i] * 45) % P;
  }
  f[19] = (f[19] + 1) % P;
  long long tmp = P - f[19];
  if (f[19])
    printf("%I64u %I64u\n", tmp + 1, tmp + (unsigned long long)1e19);
  else
    printf("1 %I64u\n", (unsigned long long)1e19);
}

```