#include<bits/stdc++.h>
using namespace std;
long long n;
struct node{
	long long a,b,c;
}k[1005];
bool cmp(node x,node y){
	x.c<x.c;
}
int main(){
	freopen("kinggame.in","r",stdin);
	freopen("kinggame.out","w",stdout);
	ios::sync_with_stdio(0);cin.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>k[i].a>>k[i].b;
		k[i].c=k[i].a*k[i].b;
	}
	sort(k+2,k+n+1,cmp);
	long long ans=-1e16,ji=k[1].a;
	for(int i=2;i<=n;i++){
		ans=max(ans,ji/k[i].b);
		ji*=k[i].a;
	}cout<<ans;
	return 0;
}