#include <bits/stdc++.h> using namespace std; using ll=long long; using vin=vector<int>; using vll=vector<long long>; using vvin=vector<vector<int>>; using vvll=vector<vector<long long>>; using vstr=vector<string>; using vvstr=vector<vector<string>>; using vch=vector<char>; using vvch=vector<vector<char>>; using vbo=vector<bool>; using vvbo=vector<vector<bool>>; using vpii=vector<pair<int,int>>; using pqsin=priority_queue<int,vector<int>,greater<int>>; #define mp make_pair #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep2(i,s,n) for(int i=(s);i<(int)(n);i++) #define all(v) v.begin(),v.end() #define decp(n) cout<<fixed<<setprecision((int)n) const ll inf=1e9+7; const ll INF=1e18; map<int,int> pf; queue<int> q; void prime_factor(int n){ for(int i=2;i*i<=n;i++){ if(n%i==0)q.push(i); while(n%i==0){ pf[i]++; n/=i; } } if(n!=1){ pf[n]++; q.push(n); } return; } int main(){ int n;cin>>n; prime_factor(n); int b=1; while(q.size()){ auto p=q.front();q.pop(); if(pf[p]%2)b*=p; } cout<<sqrt(n/b)<<" "<<b<<endl; }