#include <bits/stdc++.h>
using namespace std;
const long long maxn = 3e5 + 50, inf = 1e18, mod = 1024523;
inline long long read() {
  char c = getchar();
  long long ans = 0, f = 0;
  for (; c < '0' || c > '9'; c = getchar()) f = (c == '-');
  for (; c >= '0' && c <= '9'; c = getchar()) (ans *= 10) += c - '0';
  return f ? -ans : ans;
}
inline void chkmax(long long &x, long long y) { x = x > y ? x : y; }
inline void chkmin(long long &x, long long y) { x = x < y ? x : y; }
inline long long max(long long x, long long y) { return x > y ? x : y; }
inline long long min(long long x, long long y) { return x < y ? x : y; }
long long calc(long long x) {
  long long ans = 0;
  for (; x; x /= 10) ans += x % 10;
  return ans;
}
unsigned long long tot = 45, add = 45;
unsigned long long l = 1, r = 1e18;
int main() {
  unsigned long long a = read();
  for (long long i = (2), upnum = (18); i <= upnum; i++) {
    (tot += add) *= 10;
    add *= 10;
    tot %= a;
    add %= a;
  }
  (tot += 1) %= a;
  cout << (l + a - tot) << " " << (r + a - tot) << endl;
  return 0;
}

### Prompt

Please create a solution in CPP to the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 3e5 + 50, inf = 1e18, mod = 1024523;
inline long long read() {
  char c = getchar();
  long long ans = 0, f = 0;
  for (; c < '0' || c > '9'; c = getchar()) f = (c == '-');
  for (; c >= '0' && c <= '9'; c = getchar()) (ans *= 10) += c - '0';
  return f ? -ans : ans;
}
inline void chkmax(long long &x, long long y) { x = x > y ? x : y; }
inline void chkmin(long long &x, long long y) { x = x < y ? x : y; }
inline long long max(long long x, long long y) { return x > y ? x : y; }
inline long long min(long long x, long long y) { return x < y ? x : y; }
long long calc(long long x) {
  long long ans = 0;
  for (; x; x /= 10) ans += x % 10;
  return ans;
}
unsigned long long tot = 45, add = 45;
unsigned long long l = 1, r = 1e18;
int main() {
  unsigned long long a = read();
  for (long long i = (2), upnum = (18); i <= upnum; i++) {
    (tot += add) *= 10;
    add *= 10;
    tot %= a;
    add %= a;
  }
  (tot += 1) %= a;
  cout << (l + a - tot) << " " << (r + a - tot) << endl;
  return 0;
}

```