ICONS

Dave has a collection of $N$ icons and wants to lay them out on his screen in a rectangular grid made of rows and columns.

Not every cell has to be filled — some cells in a row may stay empty — so a grid with $R$ rows and $C$ columns can hold all of the icons as long as it has at least $N$ cells, that is, $R \times C \ge N$.

Dave wants the layout to be as compact as possible: among all grids that can hold every icon, he wants the sum of the number of rows and the number of columns, $R + C$, to be as small as possible.

Given $N$, write a program that reports the dimensions of such a minimal grid.

A single line containing one natural number $N$ ($1 \le N \le 100$), the number of icons to arrange.

Print two integers — the number of rows $R$ and the number of columns $C$ — separated by a single space. The grid must satisfy $R \times C \ge N$, and $R + C$ must be as small as possible.

Several grids can share the same minimal sum, so to make the answer unique, print the most balanced grid: the one whose two sides are as close to each other as possible, with the number of rows not larger than the number of columns ($R \le C$). Equivalently, if $S$ is the smallest achievable value of $R + C$, then $R = \lfloor S/2 \rfloor$ and $C = \lceil S/2 \rceil$.