Job Applications
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

After finishing university, Anton decided to start looking for a job.

He immediately went to the ConnectedIn website. When he went to the "Vacancies" tab, he saw a lot of job openings. However, the exact number of vacancies was not specified on the website. He knows that there are a maximum of $$$20$$$ vacancies on each page, and the vacancies take up $$$n$$$ pages.

You have a good understanding of how the website works. When a new vacancy is added, it is added to the last page. If there are already $$$20$$$ vacancies on the last page before adding a new one, a new page is created and the vacancy is added there.

Knowing this information, determine the minimum and maximum number of vacancies.

Input

The first line of the input contains a single integer $$$n$$$ ($$$1 \le n \le 100$$$) — the number of pages with vacancies.

Output

Print two integers — the minimum and maximum number of vacancies that could be on the website.

Examples

Input

    3

Output

    41 60

Input

    14

Output

    261 280