#include<bits/stdc++.h>
using namespace std;
ifstream f("nummst.in");
ofstream g("nummst.out");
int n;
int main()
{
    f >> n;
    int a = 0;
    int b = 0;
    for(int i = 2; i * i <= n; ++i)
        if(n % i == 0)
        {
            a = i;
            b = n/i;
            break;
        }
    long long mx = 0;
    int unde = 0;
    for(int i = b; i <= n - b; i += b)
    {
        long long aa = i/b;
        long long bb = (n - i)/b;
        if(aa * bb / __gcd(aa, bb) > mx)
            mx = aa * bb / __gcd(aa, bb), unde = aa;
    }
    g << unde * b << " " << n - unde * b;
    return 0;
}