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:
//package Codeforces;

import java.util.Random;
import java.util.Scanner;

public class A1269 {
    private static int getRandomNumberInRange(int min, int max) {

        if (min >= max) {
            throw new IllegalArgumentException("max must be greater than min");
        }

        Random r = new Random();
        return r.nextInt((max - min) + 1) + min;
    }
    static boolean isPrime(int n)
    {
        // Corner cases
        if (n <= 1)
            return false;
        if (n <= 3)
            return true;

        // This is checked so that we can skip
        // middle five numbers in below loop
        if (n % 2 == 0 || n % 3 == 0)
            return false;

        for (int i = 5; i * i <= n; i = i + 6)
            if (n % i == 0 || n % (i + 2) == 0)
                return false;

        return true;
    }
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        boolean findA = false;
        boolean findB = false;
        //int b = getRandomNumberInRange(4,1000000000-n);
        int b =4;
        int a = b + n;

        while(findA == false && findB == false){
//            if (b%2==0 || b%3==0){
//                findB = true;
//                if (a%2==0 || a%3==0) {
//                    findA = true;
//                    System.out.println(a+" "+b);
//                    //System.out.print(" ");
//                    //System.out.print(b);
//
//                }
//            }
            if (!isPrime(b) && !isPrime(a)){
                findB = true;
                findA = true;
                System.out.println(a+" "+b);
            }
            else{
                b = b+1;
                a = b+n;
            }



        }
    }
}