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:
// package test;
import java.io.*;
import java.util.* ;

public class Testr {
	

	public static void main(String[] args) throws IOException {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int t = Integer.parseInt(br.readLine()) ;
		Testr x = new Testr() ;
//		String y = br.readLine();
//		StringBuilder k = new StringBuilder(y) ; 
		int a = 0, b = 0;
		for (int j = 4 ; j < 1000000001-t  ; j++) 
		{
			if ( x.isnotprime(j) && x.isnotprime(j+t))
			{
				a = j+t ; b = j ; break;
			}
		}
		
		System.out.println(a+" "+b);
		
		}
	
	public boolean isnotprime(int i)
	{
		for (int j = 2 ; j <= (int)Math.sqrt(i) ; j++)
		{
			if (i % j == 0) return true ;
		}
		return false;
	}
		
	}