#include <iostream>
#include <algorithm>

using namespace std;

typedef long long LL;
const int N = 110;
LL a[N];
LL p[N], q[N]; //p存分子，q存分母
int cnt;
int n;

LL gcd(LL a, LL b)
{
    return b ? gcd(b, a % b) : a;
}

LL sub_gcd(LL a, LL b)
{
    if (a < b)
        swap(a, b);
    if (b == 1)
        return a;
    else
        return sub_gcd(b, a / b);
}

int main()
{
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    sort(a, a + n);
    LL t;
    //化简分式
    for (int i = 1; i < n; i++)
    {
        t = gcd(a[i], a[i - 1]);
        p[cnt] = a[i] / t;
        q[cnt] = a[i - 1] / t;
        cnt++;
    }
    //辗转相减法
    LL res1, res2;
    res1 = sub_gcd(p[0], p[1]), res2 = sub_gcd(q[0], q[1]);
    for (int i = 2; i < cnt; i++)
    {
        res1 = sub_gcd(res1, p[i]);
        res2 = sub_gcd(res2, q[i]);
    }
    cout << res1 << "/" << res2 << endl;
    return 0;
}
