Trial Task 2

Time limit1sMemory limit128 MB

Summary

Given n scored rounds plus one trial round with 2 to 3 problems each, print the smallest and largest possible total problem counts.

Level: Easy1 of 10
Topics: Math
Solved: No attempts yet

Problem

Suppose this year's contest consists of $n$ scored rounds and one trial round. By the rules, each round holds at least 2 and at most 3 problems. How many problems can appear over the entire contest?

Input

The first and only line contains a natural number $n$ ( $1 \le n \le 1000$ ).

Output

Print two integers separated by a single space. The first is the minimum number of problems that can appear during $n$ scored rounds and one trial round. The second is the maximum number of problems in this contest.

Examples1

Example 1
Input
```
5
```
Expected output
```
12 18
```