#include<iostream>
#include<algorithm>
using namespace std;
//下表数组 

vector<long long>a(10001),b(10001);

bool cmp(long long i,long long j){
	return a[i]*b[i]<a[j]*b[j];
} 

int main() {
	long long n,ans=0,q=1;
	
	cin>>n;
	vector<long long> in(n+1);
	cin>>a[0]>>b[0];
	for(int  i = 1;i<=n;i++) {
		cin>>a[i]>>b[i];
		in[i]=i;
	}
	q=a[0];
	sort(in.begin(),in.end(),cmp);
	for(int i = 1;i<=n;i++){
//		cout<<in[i]<<" ";
		long long s=q/b[i];
		q*=a[i];
		if(s>ans) ans=s;
	}
	
	cout<<ans;
	return 0;
}