//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si static inline
#define mp make_pair
#define fi first
#define se second
using namespace std;typedef long long ll;typedef __int128 li;typedef long double ld;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;typedef const int ci;
typedef const ll cl;const int iinf=INT_MAX;const ll linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{

	ci N=105;
	const ld eps=5e-7;

	int n,m;
	string a[N];
	int cur[N];
	
	si string ts(ld x){
		string res="0.";
		// cerr<<"TS "<<x<<endl;
		while(res.size()<=m){
			int k=x*10;
			res+=char('0'+k),x=x*10-k;
			// cerr<<k<<' '<<x<<endl;
		}
		// cerr<<res<<endl;
		if(res.back()>='5'){
			for(int i=m-1;i>1;i--){
				if(res[i]=='9')res[i]='0';
				else{
					res[i]++;
					break;
				}
			}
		}
		res.pop_back();
		return res;
	}
	void mian(){
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i];
			if(a[i][0]=='1')return cout<<"1\n",void();
		}
		m=a[1].size();

		cerr<<fixed<<setprecision(6);
		for(int i=1;i<=1000000;i++){
			bool flag=1;
			ld d=(ld)1/i;
			int tot=0;
			for(int j=1;j<=n;j++){
				if(cur[j])cur[j]--;
				string now=ts(cur[j]*d);
				// if(i==7766)cerr<<j<<' '<<cur[j]<<' '<<now<<' '<<cur[j]*d<<endl;
				while(now<a[j])now=ts((++cur[j])*d);
				// if(i==7766)cerr<<j<<' '<<cur[j]<<' '<<d<<' '<<now<<' '<<cur[j]*d<<' '<<a[j]<<endl;
				if(now!=a[j]){flag=0;break;}
				tot+=cur[j];
			}
			if(flag&&tot==i){
				cout<<i<<endl;
				// for(int j=1;j<=n;j++)cerr<<cur[j]<<' '<<cur[j]*d<<endl;
				return ;
			}
		}
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	cerr<<"EXEC TIME: "<<1.0*clock()/CLOCKS_PER_SEC<<endl;
	return 0;
}