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

public class Main {

    public static void main(String[] args) throws IOException{
        BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));
        int[] composite=new int[10000001];
        for(int i=2;i*i<=10000001;i++)
        {
            if(composite[i]==0)
            {
                for(int j=i*i;j<10000001;j+=i)
                {
                    composite[j]=1;
                }
            }
        }
        int n=Integer.parseInt(br.readLine());
        int flag=0;
        for(int i=2;i<n;i++)
        {
            if(n%i==0)
            {
                flag=1;
                break;
            }
        }
        if(flag==1)
        {
            int a = n,b=2*n;
            bw.write(b+" "+a);
            bw.flush();
        }
        else{
        for(int i=2+n;i<10000001;i++)
        {
            if(composite[i]==1 && composite[i-n]==1)
            {
                bw.write(i+" "+(i-n));
                break;
            }
        }
        }
	bw.flush();   
    }
}