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.lang.*;
import java.util.*;
import java.io.*;
public class test
{  

	Scanner sc=new Scanner(System.in);
	PrintWriter pr=new PrintWriter(System.out,true);
	public static void main(String... args) 
	{
       test c=new test();
       c.prop();
	}
	public void prop() 
	{
    int n,x=0,a=4,b=0 ;
     n=sc.nextInt();
      for (int i=4;x==0 ;i+=2) {
        
          a=n+i ;
          b=i ;
              for (int j=2;j<a ;++j) {
                    if(a%j==0)
                       {x=1; break ;}
              }
      }
     pr.println(a+" "+b); 
                  

       
  }
  
}