//-DYUNQIAN -std=c++14 -O2 -Wall
#include<bits/stdc++.h>

#define ll long long
#define int long long
#define fi first
#define se second
#define mk make_pair

using namespace std;

inline int read(){
    int x=0,f=1;char c=getchar();
    for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
    for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
    return x*f;
}

const int mod=1e9+7;
int ksm(int x,int y,int p=mod){
    int ans=1;
    for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
    return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}

void Assert(bool c,int L=0){if(!c){cout<<"Assertion Failed at "<<L<<endl;exit(0);}}

void cmax(int &x,int v){x=max(x,v);}
void cmin(int &x,int v){x=min(x,v);}

const int N=105;
int P[N],L,n;
string str[N];

signed main(void){
	
#ifdef YUNQIAN
	freopen("in.in","r",stdin);
#endif		
	
	cin>>n;
	for(int i=1;i<=n;i++)cin>>str[i];
	L=str[1].size()-2;
	int W=1;for(int i=1;i<=L;i++)W*=10;
	
	for(int i=1;i<=n;i++){
		double val=0;
		for(int j=str[i].size()-1;j>=2;j--)val=val/10+(str[i][j]-'0');val=val/10+str[i][0]-'0';
		P[i]=(int)(val*W+0.5);
//		cout<<"P "<<i<<" = "<<P[i]<<endl;
	}
	auto chk=[&](int k){
//		cout<<"k = "<<k<<endl;
		vector<ll>ps(n+1);
		for(int i=1;i<=n;i++)ps[i]=1ll*P[i]*k;
		vector<ll>D(n+1);
		for(int i=1;i<=n;i++){
			if(P[i]==0)continue;
			ll l=ps[i]-(int)(k/2);
			ll r=ps[i]+(int)(k/2);if(k%2==0)r--;
//			cout<<"[l,r] = ["<<l<<","<<r<<"]\n";
			if(l%W==0)D[i]=l/W;
			else if((ll)(l/W)!=(ll)(r/W))D[i]=r/W;
			else return false;
		}
		for(int i=1;i<=n;i++)k-=D[i];
		return k==0;
	};
	for(int k=1;;k++)if(chk(k)){cout<<k<<endl;break;}

    return 0;
}