//By: OIer rui_er
#include <bits/stdc++.h>
#define rep(x,y,z) for(ll x=(y);x<=(z);x++)
#define per(x,y,z) for(ll x=(y);x>=(z);x--)
#define debug(format...) fprintf(stderr, format)
#define fileIO(s) do{freopen(s".in","r",stdin);freopen(s".out","w",stdout);}while(false)
using namespace std;
typedef long long ll;

mt19937 rnd(std::chrono::duration_cast<std::chrono::nanoseconds>(std::chrono::system_clock::now().time_since_epoch()).count());
ll randint(ll L, ll R) {
    uniform_int_distribution<ll> dist(L, R);
    return dist(rnd);
}

template<typename T> void chkmin(T& x, T y) {if(x > y) x = y;}
template<typename T> void chkmax(T& x, T y) {if(x < y) x = y;}

const ll N = 105;

ll n, L, val[N];
char s[N][10];

int main() {
    scanf("%lld", &n);
    rep(i, 1, n) {
        scanf("%s", s[i]+1);
        L = (ll)strlen(s[i]+1);
        if(s[i][1] == '1') return puts("1")&0;
        rep(j, 3, L) val[i] = 10 * val[i] + (s[i][j] ^ 48);
    }
    L -= 2; // "0."
    ll lim = 1;
    rep(i, 1, L) lim *= 10;
    rep(i, 2, lim) {
        ll sum = 0, ok = 1;
        rep(j, 1, n) {
            ll now = ll(round(1.0 * val[j] / lim * i));
            sum += now; // check sum to 1
            if(ll(round(1.0 * now / i * lim)) != val[j]) {ok = 0; break;} // check precision
        }
        if(sum == i && ok) return printf("%lld\n", i)&0;
    }
    return 0;
}