← 返回题目

题库练习 Equation

← 上一题下一题 →

A13144 | $Equation$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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.

输入格式

The input contains one integer $n$ ( $1 \leq n \leq 10^7$ ): the given integer.

输出格式

Print two composite integers $a,b$ ( $2 \leq a, b \leq 10^9, a-b=n$ ). It can be proven, that solution always exists. If there are several possible solutions, you can print any.

输入输出样例

输入 #1

输出 #1

9 8

输入 #2

输出 #2

4608 4096

C++ 编辑器

输入

输出