#include <bits/stdc++.h>

using namespace std;

ifstream fin("aliens.in");
ofstream fout("aliens.out");

const int l3 = 18 * 50, l5 = 12 * 50;

short int dp[2][l3 + l3 + 5 + 30][l5 + l5 + 5 + 30], inf = -30000, p, q, u, v, ans2, ans3, ans5, vv[6000];

double best = -1;

void inmul(int a)
{
    int t = 0;
    for (int i = 1; i <= vv[0]; ++i)
    {
        vv[i] = vv[i] * a + t;
        t += vv[i] / 10;
        vv[i] %= 10;
    }
    while (t)
    {
        vv[++vv[0]] = t % 10;
        t /= 10;
    }
}

int main()
{
    for (int i = 0; i <= l3 + l3 + 30; ++i)
    {
        for (int j = 0; j <= l5 + l5 + 30; ++j)
        {
            dp[0][i][j] = inf;
        }
    }
    dp[0][l3][l5] = 0;
    int n;
    fin >> n;
    for (int i = 1; i <= n; ++i)
    {
        int x, y;
        short int p2 = 0, p3 = 0, p5 = 0;
        fin >> x >> y;
        while (x % 2 == 0) x /= 2, ++p2;
        while (x % 3 == 0) x /= 3, ++p3;
        while (x % 5 == 0) x /= 5, ++p5;

        while (y % 2 == 0) y /= 2, --p2;
        while (y % 3 == 0) y /= 3, --p3;
        while (y % 5 == 0) y /= 5, --p5;

        if (p3 >= 0) p += p3;
        else q += p3;
        if (p5 >= 0) u += p5;
        else v += p5;

        for (int j = 0; j <= l3 + l3; ++j)
        {
            for (int k = 0; k <= l5 + l5; ++k)
            {
                dp[i % 2][j][k] = inf;
            }
        }

        for (int j = q; j <= p; ++j)
        {
            for (int k = v; k <= u; ++k)
            {
                dp[i % 2][j + l3][k + l5] = inf;
                if (dp[1 - i % 2][j + l3][k + l5] > dp[i % 2][j + l3][k + l5])
                {
                    dp[i % 2][j + l3][k + l5] = dp[1 - i % 2][j + l3][k + l5];
                }
                if (p2 + dp[1 - i % 2][j - p3 + l3][k - p5 + l5] > dp[i % 2][j + l3][k + l5])
                {
                    dp[i % 2][j + l3][k + l5] = p2 + dp[1 - i % 2][j - p3 + l3][k - p5 + l5];
                }
            }
        }
    }
    for (int i = 0; i <= l3; ++i)
    {
        for (int j = 0; j <= l5; ++j)
        {
            short int p2 = dp[n % 2][i + l3][j + l5];
            if (p2 >= 0)
            {
                double val = log(2.0) * p2 + log(3.0) * i + log(5.0) * j;
                if (val > best)
                {
                    best = val;
                    ans2 = p2;
                    ans3 = i;
                    ans5 = j;
                }
            }
        }
    }
    vv[0] = 1;
    vv[1] = 1;
    for (int i = 1; i <= ans2; ++i) inmul(2);
    for (int i = 1; i <= ans3; ++i) inmul(3);
    for (int i = 1; i <= ans5; ++i) inmul(5);
    for (int i = vv[0]; i >= 1; --i) fout << vv[i];
    fin.close();
    fout.close();
    return 0;
}