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 Practice {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		long n = sc.nextLong();
		long a,b;
		for(int i = 2;i<Math.pow(10, 9);i++)
		{
			if(i>2 && i%2==0)
			{
				if((n+i)%2==0)
				{
					System.out.println((n+i)+ " "+ i);
					System.exit(0);
				}
				
			}
			else
			{
				if(isPrime(i) == false)
				{
					if((n+i)%2==0)
					{
						System.out.println((n+i)+ " "+ i);
						System.exit(0);
					}
					else
						if(isPrime(n+i) == false)
						{
							System.out.println((n+i)+ " "+ i);
							System.exit(0);
						}
						else
						{
							continue;
						}
				}
			}
		}
		
	}
	public static boolean isPrime(long num)
	{
		if(num<=2)
			return true;
		for(int i=2;i<Math.sqrt(num);i++)
		{
			if(num%i==0)
				return false;
			else
				continue;
		}
		return true;
	}
}