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 getSum(long long x) {
  long long sum = 0;
  while (x) {
    sum += x % 10;
    x /= 10;
  }
  return sum;
}
vector<long long> sums;
int main() {
  long long a;
  cin >> a;
  long long x = (45 * 20) % a;
  for (int i = 1; i <= 19; ++i) {
    long long ox = x;
    for (int j = 2; j <= 10; ++j) {
      x += ox;
      x %= a;
    }
  }
  x = (a - x) % a;
  if (x == 0) {
    cout << "1 ";
    for (int i = 0; i < 20; ++i) cout << "9";
    cout << "\n";
  } else {
    cout << x << " 10";
    long long step = 1;
    for (int i = 1; i <= 18; ++i) step *= 10;
    x--;
    for (int i = 18; i >= 0; --i) {
      cout << x / step;
      x %= step;
      step /= 10;
    }
    cout << "\n";
  }
  return 0;
}
