#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

const int N = 10000000;
int prime_fac[N+1];
bool is_prime[N+1];

void init(){
    for(int x = 2; x <= N; x++) is_prime[x] = true;
    for(int p = 2; p <= N; p++){
        if(!is_prime[p]) continue;
        for(int i = 1; i*p <= N; i++){
            if(i >= 2) is_prime[i*p] = false;
            prime_fac[i*p] = p;
        }
    }
}

int diff[N+1];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    int k; cin >> k;
    vector<int> p(k), e(k);
    for(int i = 0; i < k; i++) {
        cin >> p[i] >> e[i];
        diff[p[i]] += e[i];
    }
    int pp = p[k-1];
    int cnt_diff = k;
    auto add = [&](int q, int x){
        if(diff[q] == 0) cnt_diff++;
        diff[q] -= x;
        if(diff[q] == 0) cnt_diff--;
    };
    for(int x = 1; x <= pp; x++){
        // 分子にかける
        int cur = pp-x+1;
        while(cur != 1){
            add(prime_fac[cur], 1);
            cur /= prime_fac[cur];
        }
        // 分母にかける
        cur = x;
        while(cur != 1){
            add(prime_fac[cur], -1);
            cur /= prime_fac[cur];
        }
        if(cnt_diff == 0){
            cout << pp << ' ' << x << endl;
            return 0;
        }
    }
    cout << -1 << ' ' << -1 << endl;
}