#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>

int main()
{
    /* input */
    int n;
    scanf( "%d", &n );

    /* process */
    int a = 1;
    int b = n;
    std::vector<int> primes;
    for ( int x=2; x<=int(std::sqrt(n))+1; x++ ) {
        bool check_prime = true;
        for ( int i=0; i<primes.size(); i++ ) {
            if ( x % primes[i] == 0 ) {
                check_prime = false;
                break;
            }
        }

        if ( check_prime == true ) {
            //printf("x:%d is prime\n",x);
            primes.push_back( x );

            while ( true ) {
                //printf( "a: %d, b: %d\n", a, b );
                if ( b % ( x * x ) == 0 ) {
                    b = b / ( x * x );
                    a = a * x;
                } else {
                    break;
                }
            }
        } else {
            //printf("x:%d is not prime\n",x);
        }
    }

    /* output */
    printf( "%d %d\n", a, b );

    return 0;
}