#include<iostream.h>
#include<fstream.h>
#include<string.h>
int x[100],n,p,cont,k,i;
float v[20],a,b,max,prod;
void tipar ()
{
int i;
for (i=0;i<=k;i++) cout<<v[x[i]]<<" ";
cout<<'\n';
}
int main ()
{
ifstream f("aliens.in");
ofstream g("aliens.out");
f>>n;
for (i=0;i<n;i++) {f>>a>>b;v[i]=a/b;}
k=0; x[k]=-1;
while (k>-1)
{
while (x[k]<n-1)
	{prod=1;
	 x[k]++; cont=1;
	  for (i=0;i<k;i++)
		if (x[i]==x[k]) cont=0;
	  for (i=0;i<k;i++)
		prod=prod*v[x[i]];
	  if (int(prod)==prod && prod>max) max=prod;
		if (cont)
		  if (k==(n-1)) break;
			 else {k++; x[k]=-1;} }

k--;
}
g<<max;
return 0;
}