#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}


//a以下の素数を列挙、計算量:Nlog(log(N))
vector<int> Eratosthenes(int a){
    if(a<2) return {};
    vector<int> p(a+1),ans;
    p[0]=1,p[1]=1;
    int k=2;
    while(k*k<=a){
        if(p[k]==0){
            ans.push_back(k);
            for(int i=2;i*k<=a;i++){
                p[i*k]=1;
            }
        }
        k++;
    }
    while(k<=a){
        if(p[k]==0) ans.push_back(k);
        k++;
    }
    return ans;
}

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	int K;
	cin>>K;
	vector<int> p(K),e(K);
	rep(i,0,K) cin>>p[i]>>e[i];
	auto primes=Eratosthenes(p[K-1]);
	int L=primes.size();
	auto f=[&](int a,int b)->int{
		int c=0;
		while(a) a/=b,c+=a;
		return c;
	};
	auto comb=[&](int r)->vector<int>{
		vector<int> res(L);
		rep(i,0,L) res[i]=f(p[K-1],primes[i])-f(r,primes[i])-f(p[K-1]-r,primes[i]);
		return res;
	};
	vector<int> ans(L);
	int ind=0;
	rep(i,0,K){
		while(p[i]>primes[ind]) ind++;
		ans[ind]=e[i];
	}
	int l=(p[K-1]+1)/2;
	int r=p[K-1];
	for(int i=L-2;i>=0;i--){
		if(primes[i]*2<p[K-1]) break;
		if(ans[i]==0){
			l=primes[i];
			break;
		}
		r=primes[i];
	}
	for(int i=l;i<r;i++){
		if(ans==comb(i)){
			cout<<p[K-1]<<" "<<i<<"\n";
			return;
		}
	}
	cout<<"-1 -1\n";
}