#include <bits/stdc++.h>
using namespace std;
unsigned long long N, s[20], p[20], a, A;
unsigned long long C;
int cnt[20];
inline void read(int &x) {
  x = 0;
  bool f = 0;
  char ch = getchar();
  for (; !(ch >= '0' && ch <= '9'); ch = getchar()) f |= ch == '-';
  for (; (ch >= '0' && ch <= '9'); ch = getchar())
    x = (x << 3) + (x << 1) + (ch ^ 48);
  x = f ? -x : x;
}
inline void reads(unsigned long long &x) {
  x = 0;
  bool f = 0;
  char ch = getchar();
  for (; !(ch >= '0' && ch <= '9'); ch = getchar()) f |= ch == '-';
  for (; (ch >= '0' && ch <= '9'); ch = getchar())
    x = (x << 3) + (x << 1) + (ch ^ 48);
  x = f ? -x : x;
}
int main() {
  reads(N);
  p[0] = 1;
  for (int i = 1; i <= 18; ++i)
    s[i] = (s[i - 1] * 10 % N + 45 * p[i - 1] % N) % N,
    p[i] = p[i - 1] * 10 % N;
  unsigned long long S = 0, P = 1e18;
  s[18] = (s[18] + 1) % N;
  S = N - s[18];
  printf("%lld %lld", S + 1, S + P);
  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;
unsigned long long N, s[20], p[20], a, A;
unsigned long long C;
int cnt[20];
inline void read(int &x) {
  x = 0;
  bool f = 0;
  char ch = getchar();
  for (; !(ch >= '0' && ch <= '9'); ch = getchar()) f |= ch == '-';
  for (; (ch >= '0' && ch <= '9'); ch = getchar())
    x = (x << 3) + (x << 1) + (ch ^ 48);
  x = f ? -x : x;
}
inline void reads(unsigned long long &x) {
  x = 0;
  bool f = 0;
  char ch = getchar();
  for (; !(ch >= '0' && ch <= '9'); ch = getchar()) f |= ch == '-';
  for (; (ch >= '0' && ch <= '9'); ch = getchar())
    x = (x << 3) + (x << 1) + (ch ^ 48);
  x = f ? -x : x;
}
int main() {
  reads(N);
  p[0] = 1;
  for (int i = 1; i <= 18; ++i)
    s[i] = (s[i - 1] * 10 % N + 45 * p[i - 1] % N) % N,
    p[i] = p[i - 1] * 10 % N;
  unsigned long long S = 0, P = 1e18;
  s[18] = (s[18] + 1) % N;
  S = N - s[18];
  printf("%lld %lld", S + 1, S + P);
  return 0;
}

```