S_N4

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}

//[123456789;223456789]

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int fr = 123456789, to = 223456789;
    //int fr = 5, to = 16;
    vector <pii> ans;
    for (int i = fr; i <= to; ++i) {
        if (i == 123476544) {
            //cout << "i = " << i << "\n";
        }
        int sq = sqrt(i);
        if (pow(sq, 2) != i) {
            continue;
        }
        int cnt=0;
        int d=-1;
        for (int j = 2; j < sqrt(i); ++j) {
                if (i % j == 0) {
                    cnt++;
                    d = i/j;
            }
        }
        if (cnt == 1) {
            ans.push_back({i, d});
        }
    }


    cvp(ans);
}