Optimal Garden Layout

You are given an integer \( N \) which represents the number of flower pots. Your task is to arrange these flower pots in a square grid (i.e. \( rows \times columns \)) such that each row and each column contains an equal number of pots and the garden has the largest possible dimensions. In other words, find the maximum integer \( k \) such that \( k^2 \leq N \). Output the value \( k \) twice (for rows and columns).

Note: Use the formula \( k = \lfloor \sqrt{N} \rfloor \) where \( \lfloor \cdot \rfloor \) denotes the floor function.

inputFormat

The input consists of a single integer \(N\) (\(0 \leq N \leq 10^{12}\)) representing the number of flower pots. The input is read from standard input.

outputFormat

Output two integers separated by a space: the optimal number of rows and columns for the garden. The output should be written to standard output.

20

4 4