#include <bits/stdc++.h>
using namespace std;
int i, j, k, m;
unsigned long long p, f[20], s[20], an;
int main() {
  scanf("%I64u", &p);
  f[0] = 0;
  s[0] = 1;
  for (i = 0; i <= 18; i++)
    for (j = 0; j <= 9; j++) {
      s[i + 1] = (s[i + 1] + s[i]) % p;
      f[i + 1] = (s[i] * j + f[i] + f[i + 1]) % p;
    }
  an = (1 + f[19]) % p;
  unsigned long long t = (p - an) % p;
  printf("%I64u %I64u\n", t + 1, t + (unsigned long long)1e19);
  return 0;
}

### Prompt

Develop a solution in CPP 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;
int i, j, k, m;
unsigned long long p, f[20], s[20], an;
int main() {
  scanf("%I64u", &p);
  f[0] = 0;
  s[0] = 1;
  for (i = 0; i <= 18; i++)
    for (j = 0; j <= 9; j++) {
      s[i + 1] = (s[i + 1] + s[i]) % p;
      f[i + 1] = (s[i] * j + f[i] + f[i + 1]) % p;
    }
  an = (1 + f[19]) % p;
  unsigned long long t = (p - an) % p;
  printf("%I64u %I64u\n", t + 1, t + (unsigned long long)1e19);
  return 0;
}

```