#include <stdio.h>
#include <string.h>
#include <set>
#include <vector>
#include <math.h>

using namespace std;
const int n_max = 100;

set <double> s;
vector <int> stiv[4];
const int p[4] = {1,2,3,5};
int v[n_max][4],
	doi[5000],
	trei[5000],
	cinci[5000],
	sol[5000];
int i, j, n, t;
double maxim;
void mul(int A[], int B[])
{
      int i, j, t, C[5000];
      memset(C, 0, sizeof(C));
      for (i = 1; i <= A[0]; i++)
      {
              for (t=0, j=1; j <= B[0] || t; j++, t/=10)
                      C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;
              if (i + j - 2 > C[0]) C[0] = i + j - 2;
      }
      memcpy(A, C, sizeof(C));
}
void print(int A[])
{
	int i;
	for (i = A[0]; i > 0; --i)
		printf("%d",A[i]);
	printf("\n");
}
int main()
{
	freopen("aliens.in","r",stdin);
	freopen("aliens.out","w",stdout);
	scanf("%d", &n);
	for (i = 1; i <= n; ++ i)
	{
		scanf("%d", &t);
		for (j = 1; j <4; ++ j)
			while (t % p[j] == 0)
			{
				t/=p[j];
				++ v[i][j];
			}
		scanf("%d", &t);
		

		for (j = 1; j <4; ++ j)
			while (t % p[j] == 0)
			{
				t/=p[j];
				--v[i][j];
			}

	}
	t = 0;
	maxim = 0;
	doi[0] = 1;
	doi[1] = 2;
	trei[0] = 1;
	trei[1] = 3;
	cinci[0] = 1;
	cinci[1] = 5;
	sol[0] = 1;
	sol[1] = 1;
	
	stiv[0].push_back(0);
	stiv[1].push_back(1);
	stiv[2].push_back(2);
	stiv[3].push_back(3);
	for (i = 1; i <= n; ++ i)
		for (j = 0; j < stiv[0].size(); ++ j)
		{
			stiv[0].push_back(stiv[0][j]+v[i][0]);
			stiv[1].push_back(stiv[1][j]+v[i][1]);
			stiv[2].push_back(stiv[2][j]+v[i][2]);
			stiv[3].push_back(stiv[3][j]+v[i][3]);
			if ((stiv[1][j]+v[i][1]>-1) && (stiv[2][j]+v[i][2]>-1) && (stiv[3][j]+v[i][3]>-1) && (log(2)*(stiv[1][j]+v[i][1]) + log(3) * stiv[2][j]+v[i][2] + log(5) * stiv[3][j]+v[i][3] > maxim) )
			{
				t = j;
				maxim = log(2)*(stiv[1][j]+v[i][1]) + log(3) * stiv[2][j]+v[i][2] + log(5) * stiv[3][j]+v[i][3];
			}
		}
		for (j = 1; j <= stiv[1][t]; ++ j)
			mul(sol, doi);
		for (j = 1; j <= stiv[2][t]; ++ j)
			mul(sol, trei);
		for (j = 1; j <= stiv[3][t]; ++ j)
			mul(sol, cinci);
	print(sol);
	return 0;
}