#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int n,ans,mx;
struct pe{
int l,r,s;
}a[1005];
bool cmp(pe x,pe y){return x.s<y.s;}
int main()
{
scanf("%d",&n);
scanf("%d%d",&a[0].l,&a[0].r);
for(int i=1;i<=n;i++)
{
scanf("%d%d",&a[i].l,&a[i].r);
a[i].s=a[i].l*a[i].r;
}
sort(a+1,a+n+1,cmp);
int tmp=1;
for(int i=0;i<=n-1;i++)
{
tmp*=a[i].l;
mx=max(mx,tmp/a[i+1].r);
}
cout<<mx<<endl;
}
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
struct ppl{
ll a,b;
} p[1005];
ll n,x; ll sum[2333],ans[2333],divn[2333];
bool cmp(ppl x,ppl y){
return x.a*x.b<y.a*y.b;
}
void compare(){
for(ll k=max(ans[0],divn[0]);k>0;k--){
if(ans[k]>divn[k])return;
if(ans[k]<divn[k]){
for(ll j=0;j<=divn[0];j++)
ans[j]=divn[j];
return;
}
}
return;
}
int main(){
scanf("%lld",&n);
for(ll i=0;i<=n;i++)scanf("%lld%lld",&p[i].a,&p[i].b);
sort(p+1,p+n+1,cmp);
memset(ans,0,sizeof(ans));
memset(sum,0,sizeof(sum));
sum[0]=1; sum[1]=1;
for(ll i=1;i<=n;i++){
x=0;
for(ll j=1;j<=sum[0];j++){
sum[j]=sum[j]*p[i-1].a+x;
x=sum[j]/10000;
sum[j]%=10000;
}
if(x>0){
sum[0]++;
sum[sum[0]]=x;
}
x=0;
memset(divn,0,sizeof(divn));
for(ll j=sum[0];j>0;j--){
divn[j]=(x*10000+sum[j])/p[i].b;
x=(x*10000+sum[j])%p[i].b;
}
divn[0]=sum[0];
while(divn[divn[0]]==0)divn[0]--;
compare();
}
printf("%lld",ans[ans[0]]);
for(ll i=ans[0]-1;i>0;i--){
printf("%lld",ans[i]/1000);
printf("%lld",ans[i]/100%10);
printf("%lld",ans[i]/10%10);
printf("%lld",ans[i]%10);
}
return 0;
}