Problem: Let's call a positive integer composite if it has at least one divisor other than 1 and itself. For example:

  * the following numbers are composite: 1024, 4, 6, 9; 
  * the following numbers are not composite: 13, 1, 2, 3, 37. 



You are given a positive integer n. Find two composite integers a,b such that a-b=n.

It can be proven that solution always exists.

Input

The input contains one integer n (1 ≤ n ≤ 10^7): the given integer.

Output

Print two composite integers a,b (2 ≤ a, b ≤ 10^9, a-b=n).

It can be proven, that solution always exists.

If there are several possible solutions, you can print any. 

Examples

Input


1


Output


9 8


Input


512


Output


4608 4096

Solution (in JAVA):

Solution:
import java.util.*;
public class code1
{
  public static void main(String[] args) 
  {
  		Scanner in = new Scanner(System.in);
  		int i,j=0,k=0,cnt=0,m=0,f=0,d=0;
  		int n = in.nextInt();
  		//int a[] = new int[n];
  		//String s = in.next();
  		//int n = s.length();
  		if(n==1)
  			System.out.println("9 8");
  		else
  		System.out.println(n*3+" "+n*2	);
  		
  }
}