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
#include <bits/stdc++.h>
using namespace std;
long long a, b;
long long c[11] = {0};
long long hh(long long q) {
  long long p = 0, o = 1;
  while (o <= q) {
    long long i = q / o, u;
    u = i % 10;
    p += (q % o + 1) * u + (i / 10) * c[9] * o;
    p %= a;
    if (u) p += c[u - 1] * o;
    p %= a;
    if (o == 1000000000000000000) break;
    o *= 10;
  }
  return p;
}
int main() {
  for (int m = 1; m <= 9; m++) c[m] = c[m - 1] + m;
  cin >> a;
  b = hh(1000000000000000000);
  cout << 1 + a - b % a << " " << 1000000000000000000 + a - b % a << endl;
}
