n = int(input())
import numpy as np
p = 2
a = 1
b = n
import math

def is_prime(n):
    if n == 1: return False

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k**2 == 0:
            return False

    return True

# print(is_prime(8))

while b > p:
    if b % p**2 == 0:
        b /= p**2
        a *= p    
    else: p += 1
    if is_prime(b) == True: break
    # print(n,p)



print(int(a),int(b))