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:
// No sorceries shall previal. //         
import java.io.PrintWriter;
import java.util.*;
import java.util.Stack;
     
public class _InVoker_ {
    	
    public static void sort(int arr[], int start, int end) { 		
		if(start>=end)
			return;		
		int mid=(start+end)/2;
		sort(arr,start,mid);
		sort(arr,mid+1,end);
		merge(arr,start,mid,end);	
	}	
	private static void merge(int arr[], int start, int mid, int end) {		
		int i, j=mid+1,c=0;
		int temp[]= new int[end-start+1];
		for(i=start;i<=mid && j<=end;c++) {
			if(arr[i]<=arr[j]) {
				temp[c]=arr[i];
				i++;
			}
			else {
				temp[c]=arr[j];
				j++;
			}
		}
		while(i<=mid) {
			temp[c]=arr[i];
			i++;c++;
		}
		while(j<=end) {
			temp[c]=arr[j];
			j++;c++;
		}
		c=0;
		for(i=start;i<=end;i++,c++)
			arr[i]=temp[c];
	}
	static class ListNode {		
		ListNode(){
			data=0;
			next=null;
		}		
		ListNode(int data){			
			this.data=data;			
		}		
		ListNode(char a){			
			this.a=a;		
		}		
		private char a;
		private int data;
		private ListNode next;
		
		public char getCharData() {
			return a;
		}
		public void setCharData(char x) {
			a=x;
		}
		public int getData() {
			return data;
		}
		public void setData(int data) {
			this.data = data;
		}
		public ListNode getNext() {
			return next;
		}
		public void setNext(ListNode next) {
			this.next = next;
		}
	}
	static long gcd(long a, long b) 
    { 
      if (b == 0) 
        return a; 
      return gcd(b, a % b);  
    } 
	public static void main(String args[]) {
    		
    	Scanner inp=new Scanner(System.in);
    	PrintWriter out= new PrintWriter(System.out);
   
    	int n=inp.nextInt();
    	if(n==1)
    		out.println("9 8");
    	else 
    	out.println(n*3+" "+n*2);
    	
    	inp.close();
    	out.close();
    }	
}