B.cpp

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define pll pair <ll, ll>
#define pii pair <int, int>
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define inf (1LL << 62)
#define loop(i, start, stop, inc) for(ll i = start; i <= stop; i += inc)
#define for1(i, stop) for(ll i = 1; i <= stop; ++i)
#define for0(i, stop) for(ll i = 0; i < stop; ++i)
#define rep1(i, start) for(ll i = start; i >= 1; --i)
#define rep0(i, start) for(ll i = (start-1); i >= 0; --i)
#define ms(n, i) memset(n, i, sizeof(n))
#define casep(n) printf("Case %lld:", ++n)
#define pn printf("\n")
#define pf printf
#define EL '\n'
#define fastio std::ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

vector <int> divisor;

int main()
{
    ll t;
    cin >> t;

    while(t--) {
        ll n;
        sl(n);

        ll l = 1, r = n-1, mn = n-1;

        for(ll i = 2; i * i <= n; i++) {
            if(n % i == 0) {
                ll j = n / i;
                divisor.pb(i), divisor.pb(j);
            }
        }

        for(int &d : divisor) {
            ll cnt = n / d;
            ll tl = d, tr = (cnt-1) * d;

            ll lcm = (tl*tr) / __gcd(tl, tr);

            if(lcm < mn) {
                mn = lcm;
                l = tl, r = tr;
            }
        }

        pf("%lld %lld\n", l, r);

        divisor.clear();
    }

    return 0;
}