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;
int f(int n) {
  int ret = 0;
  while (n > 0) {
    ret += n % 10;
    n /= 10;
  }
  return ret;
}
unsigned long long pw = 18;
unsigned long long ten[20] = {1};
int main() {
  std::ios_base::sync_with_stdio(false);
  unsigned long long a;
  cin >> a;
  for (int i = int(1); i < int(20); i++) ten[i] = ten[i - 1] * 10;
  unsigned long long r = (ten[pw - 1] % a * 45 % a * pw % a + 1) % a;
  r = (a - r) % a;
  cout << r + 1 << " " << ten[pw] + r << endl;
  return 0;
}
