#include <bits/stdc++.h>
using namespace std;
bool reverseVector(long long a, long long b) { return a > b; }
long long gcd(long long a, long long b) {
  long long a1 = 0;
  if (b == 0)
    return a;
  else {
    a1 = a % b;
    return gcd(b, a1);
  }
}
bool isPrime(long long num) {
  long long n = 1000001;
  vector<bool> seive(n);
  for (long long i = 0; i < n; i++) seive[i] = true;
  for (long long i = 2; i * i <= n; i++) {
    if (seive[i] == true) {
      for (long long j = i * i; j <= n; j++) seive[j] = false;
    }
  }
  if (seive[num] == true)
    return true;
  else
    return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  long long a, b;
  a = sqrt(n);
  while (a > 0 && n % a != 0) a--;
  b = n / a;
  cout << a << " " << b << "\n";
}

### Prompt

In CPP, your task is to solve the following problem:

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. 

Examples

Input

8


Output

2 4


Input

64


Output

8 8


Input

5


Output

1 5


Input

999999


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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
bool reverseVector(long long a, long long b) { return a > b; }
long long gcd(long long a, long long b) {
  long long a1 = 0;
  if (b == 0)
    return a;
  else {
    a1 = a % b;
    return gcd(b, a1);
  }
}
bool isPrime(long long num) {
  long long n = 1000001;
  vector<bool> seive(n);
  for (long long i = 0; i < n; i++) seive[i] = true;
  for (long long i = 2; i * i <= n; i++) {
    if (seive[i] == true) {
      for (long long j = i * i; j <= n; j++) seive[j] = false;
    }
  }
  if (seive[num] == true)
    return true;
  else
    return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  long long a, b;
  a = sqrt(n);
  while (a > 0 && n % a != 0) a--;
  b = n / a;
  cout << a << " " << b << "\n";
}

```