#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-10
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define db double
#define ve vector<int>
#define pa pair<int,int>
#define fr first
#define sd second
#define pb push_back
#define mp make_pair
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
#define N 110
int n;
double a[N];
string s[N];
int cl(double c)
{
	int s = 0;
	while (c > eps)
	{
		c = c * 10;
		c = c - floor(c);
		s ++;
	}
	return s;
}
void sol()
{
	cin >> n;
	for (int i = 1; i <= n; i ++)cin >> s[i];
	int len = s[1].length() - 2;
	for (int i = 1; i <= n; i ++)
	{
		a[i] = s[i][0] - '0';
		double t = 1;
		for (int j = 2; j <= s[i].length() - 1; j ++)
		{
			t = t / 10.0;
			a[i] = a[i] + (s[i][j] - '0') * t;
		}
	}
	double EPS = 1.0 / 2.0 * pow(10, -len);
	for (int K = 1;; K ++)
	{
		int flag = 1;
		for (int i = 1; i <= n; i ++)
		{
			double l = (a[i] - EPS) * K, r = (a[i] + EPS) * K - eps;
			// if (K == 7)cout << l << ' ' << r << endl;
			if (ceil(l) > floor(r)) {flag = 0; break;}
		}
		// if (flag)return ;
		if (flag) {cout << K << '\n'; return ;}
	}
}
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T = 1;
	while (T --)sol();
	return 0;
}