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.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
 
public class Main {
   public static void main(String[] args) {
       Scanner in = new Scanner(System.in);
       BigInteger a = in.nextBigInteger();
 
       BigInteger A = BigInteger.TEN.pow(50);
       BigInteger B = BigInteger.TEN.pow(49);
 
       BigInteger res = B.multiply(BigInteger.valueOf(45).multiply(BigInteger.valueOf(50)));
       res = res.remainder(a);
 
       if (res.compareTo(BigInteger.ZERO) == 0) {
       	   System.out.print("1 ");
       	   for (int i = 0; i < 50; ++i) {
       	   	System.out.print("9");
       	   }
       	   System.out.println();
           return;
       }
 
       BigInteger left = a.subtract(res);
       BigInteger right = A.add(left.subtract(BigInteger.ONE));
       System.out.println(left + " " + right);
   }
}