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;
template <class T>
inline void umax(T &x, T y) {
  x = x ^ ((x ^ y) & -(x < y));
}
template <class T>
inline void umin(T &x, T y) {
  x = y ^ ((x ^ y) & -(x < y));
}
const int N = 2e5, B = (1 << 30);
long long a, p = 1e18;
unsigned long long s = 1e17;
int main() {
  cin >> a;
  s = (s * 45) % a;
  s = (s * 18 + 1) % a;
  a -= s;
  cout << a + 1 << " " << p + a << "\n";
  return !1;
}
