Description

Given a serial number $s$, find the first pair of "Very Good Friends" such that the first serial number is not less than $s$.

Input Format

A single line containing one integer $s$, the given lower bound of the serial number.

Output Format

Output one line with two integers $a$ and $b$.

$a$ denotes the first student with a serial number not less than $s$ who has a "Very Good Friend", and $b$ is the "Very Good Friend" of $a$. (Note: $b<s$ is allowed.)

206

220 284

Hint

Constraints

• For $100\%$ of the testdata, it is guaranteed that $6\le s\le1.8\times10^4$.

Translated by ChatGPT 5