Preparando MOJI

Display Size

1000ms 262144K

Description:

A big company decided to launch a new series of rectangular displays, and decided that the display must have exactly n pixels.

Your task is to determine the size of the rectangular display — the number of lines (rows) of pixels a and the number of columns of pixels b, so that:

  • there are exactly n pixels on the display;
  • the number of rows does not exceed the number of columns, it means a ≤ b;
  • the difference b - a is as small as possible.

Input:

The first line contains the positive integer n (1 ≤ n ≤ 106) — the number of pixels display should have.

Output:

Print two integers — the number of rows and columns on the display.

Sample Input:

8

Sample Output:

2 4

Sample Input:

64

Sample Output:

8 8

Sample Input:

5

Sample Output:

1 5

Sample Input:

999999

Sample Output:

999 1001

Note:

In the first example the minimum possible difference equals 2, so on the display should be 2 rows of 4 pixels.

In the second example the minimum possible difference equals 0, so on the display should be 8 rows of 8 pixels.

In the third example the minimum possible difference equals 4, so on the display should be 1 row of 5 pixels.

Informação

Codeforces

Provedor Codeforces

Código CF747A

Tags

brute forcemath

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:11:10

Relacionados

Nada ainda