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 mod;
int cal(long long a) {
  int ans = 0;
  while (a) {
    ans += a % 10;
    a /= 10;
  }
  return ans % mod;
}
int sol(int n) {
  long long ans = 0;
  for (int i = 0; i <= n; i++) ans += cal(i);
  return ans;
}
long long T = 1e17;
int main() {
  long long n;
  cin >> mod;
  n = mod;
  n -= 5 * (9 * (18 * T % mod) % mod) % mod;
  cout << n << ' ' << n + T * 10 - 1 << endl;
  return 0;
}
