#include<bits/stdc++.h>
#define int long long
using namespace std; 
const int N=1e3+2;
struct node{
    int a,b;
} p[N];

int n;

bool cmp(node x,node y){
    return x.a*x.b+y.b<y.a*y.b+x.b;
}
signed main()
{
    freopen("kinggame.in","r",stdin);
    freopen("kinggame.out","w",stdout);
    cin>>n;
    for(int i=0;i<=n;i++) cin>>p[i].a>>p[i].b;
    sort(p+1,p+1+n,cmp);
    int ans=0;
    int s=p[0].a;
    for(int i=1;i<=n;i++){
        ans=max(ans,s/p[i].b);
        s*=p[i].a;
    }
    cout<<ans<<endl;
    return 0;
}