#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

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

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

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n;
int a[25];
db b[25];

int nxt[25];
#define eps 1e-7
db dp[1 << 22];
int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&n);
	rep(i,0,n - 1) scanf("%d",&a[i]);
	sort(a,a + n);
	rep(S,0,(1 << n) - 1){
		int j = -1;
		rep(i,0,n - 1){
			if(((S >> i) & 1) == 0){
				nxt[i] = j;
				continue;
			}
			b[i] = dp[S - (1 << i)];
			if(b[i] < a[i] - eps) j = i;
			nxt[i] = j;
		}

		db sum0 = -1,sum1 = 0;
		if(nxt[n - 1] == -1) dp[S] = 0;
		else dp[S] = a[nxt[n - 1]];
//		rep(i,0,n - 1) printf("%d ",nxt[i]);
//		printf("\n");
//		if(S + 1 == (1 << n)){
//			printf("qwq\n");
//			rep(i,0,n - 1) printf("%.5f %.5f\n",a[i] * 1.0,b[i]);
//		}
		per(i,n - 1,0){
			if(((S >> i) & 1) == 0 || b[i] >= a[i] - eps) continue;
			sum0 += a[i] / (a[i] - b[i]);
			sum1 += 1 / (a[i] - b[i]);
			if(sum0 > a[i] * sum1) continue;
			if(i && nxt[i - 1] != -1) chkmin(dp[S],max(a[nxt[i - 1]] * 1.0,sum0 / sum1));
			else chkmin(dp[S],sum0 / sum1);
//			printf("sum0=%.10f sum1=%.10f\n",sum0,sum1);
		}
		rep(i,0,n - 1) if((S >> i) & 1 && b[i] >= a[i] - eps) chkmax(dp[S],a[i] * 1.0);
//		printf("%d->%.10f\n",S,dp[S]);
	}
	printf("%.10f\n",dp[(1 << n) - 1]);
	return 0;
}