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.math.*;
public class Main {
public static void main(String [] args){
	Scanner in=new Scanner(System.in);
	BigInteger mod=in.nextBigInteger();
	BigInteger end=BigInteger.valueOf(1000000000000000000L);
	BigInteger end1=end.divide(BigInteger.valueOf(10));
	//System.out.println(end1);
	BigInteger temp = BigInteger.valueOf(45).multiply(BigInteger.valueOf(18)).multiply(end1);
	temp=temp.mod(mod);
	//System.out.println((mod-temp)+" "+temp);
	if(temp.longValue()==0){
	System.out.print("1"+" "+(end.subtract(BigInteger.valueOf(1))));
	return;
	}
	temp=temp.add(BigInteger.valueOf(1));
	long t=(mod.subtract(temp)).longValue();
	System.out.print((t+1)+" "+(end.longValue()+t));
}	
}