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.*;

public class Prog {
  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    int n = in.nextInt();
      for (int i = 4; i < 100000; i++) {
        if (prime(i) && prime(i+n)) {
          System.out.println((i+n) + " " + i);
            System.exit(0);
         }
      }
  }
  public static boolean prime(int n) {
    int i = 2;
    while (i*i <= n) {
      if (n % i == 0) { return true; }
        i++;
    }
    return false;
  }
}