cpp
#include<bits/stdc++.h>
#define ll long long 
using namespace std;
const int N =10100;
ll int maxn=0;
ll int t;

struct ty
{
	int x,y;
	int sum;
}a[N];

bool cmp(ty a,ty b)
{
	return a.x * a.y < b.x * b.y; 
}

int main()
{
	int n;
	cin>>n;
    for(int i=0;i<=n;i++)
		scanf("%d %d",&a[i].x,&a[i].y);
	sort(a+1,a+1+n,cmp);
	cout<<endl;
    a[0].sum=1;
//    int s=1;
	for(int i=1;i<=n;i++)
	{
		a[i].sum=a[i-1].sum*a[i].x;
		t=a[i-1].sum/a[i].y;
		maxn=max(t,maxn);
	}
//	for(int i=1;i<=n;i++)
//		cout<<a[i].x<<" "<<a[i].y<<" "<<a[i].sum<<" "<<t<<endl;
	cout<<maxn<<endl;
	return 0;
}