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;
const int M = 100010;
int main() {
  ios_base::sync_with_stdio(false);
  unsigned long long a, first, p[30], d = 18;
  cin >> a;
  p[0] = 1;
  for (unsigned long long i = 1; i < 30; i++) p[i] = (10 * p[i - 1]);
  first = ((5 * ((d * p[d - 1]) % a)) % a * 9) % a;
  cout << a - first << " " << p[d] - 1 + a - first << endl;
  return 0;
}
