#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1e4 + 10;
int n;
int o[N], x[N];
int get_sum(int mid)
{
int cnt = 0;
for (int i = 0; i < n; i ++)
{
if (o[i] / mid == x[i]) cnt ++;
}
return cnt;
}
int main() {
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);
cin >> n;
int end = 1e9;
for (int i = 0; i < n; i ++)
{
cin >> o[i] >> x[i];
end = min(end, o[i] / x[i]);
}
int l = 0, r = end;
while(l < r)
{
int mid = l + r >> 1;
if (get_sum(mid) == n) r = mid;
else l = mid + 1;
}
cout << l << " " << end << endl;
return 0;
}