#include <iostream>
#include <queue>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
using namespace std;
//英语 看博友好分析 贪心 数学
int main()
{
int n;
cin>>n;
//priority_queue<double,vector<double>,greater<double> > pq;
priority_queue<double> pq;
for(int i=0;i<n;i++)
{
double t;
cin>>t;
pq.push(t);
}
while(pq.size()!=1)
{
double a=pq.top();
pq.pop();
double b=pq.top();
pq.pop();
//cout<<a<<" "<<b<<" "<<sqrt(a*b)*2.0<<endl;
pq.push(2.0*sqrt(a*b));
}
cout<<fixed<<setprecision(3)<<pq.top()<<endl;
return 0;
}