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
import java.io.*;
import java.util.*;
import java.math.*;

public class p468c {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        BigInteger a = sc.nextBigInteger();
        BigInteger a1 = new BigInteger("1");
        BigInteger a9 = new BigInteger("9");
        BigInteger a10 = new BigInteger("10");
        BigInteger p = a10.pow(21);
        BigInteger q = a10.pow(20);
        BigInteger res = a.subtract((p.multiply(a9)).mod(a));
        BigInteger l = res;
        BigInteger r = (q.add(res)).subtract(a1);
        System.out.println(l + " " + r);
    }
}