#include<bits/stdc++.h> using namespace std; struct peo{ int l,r,c;bool boo=1; bool operator <(const peo &o)const{ if(l!=o.l) return l<o.l; else return r>=o.r; } }; peo a[1005]; int b[1005]; int main(){ int n; cin>>n; for(int i=1;i<=n+1;i++){ cin>>a[i].l>>a[i].r; b[i]+=b[i-1]+a[i].l; } //for() a[1].boo=0; sort(a+1,a+n+1); int maxn=0; for(int i=1;i<=n;i++){ a[i].c=floor(b[i]/a[i].r); if(a[i].boo) maxn=max(maxn,a[i].c); } cout<<maxn; return 0; }