#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double lb;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<lb> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int m;
double s[1<<11];

double solve() {
    double p[m+1][1<<m];
    for (int i = 0; i <= m; i++)
        for (int j = 0; j < (1<<m); j++)
            p[i][j] = 0.0;
    for (int i = 0; i < (1<<m); i++) p[0][i] = 1.0;
    
    int h = 2;
    for (int i = 1; i <= m; i++, h *= 2) {
        for (int j = 0; j < (1<<m); j += h) {
            for (int k = j; k < j+h/2; k++) {
                for (int l = j+h/2; l < j+h; l++) {
                    p[i][k] += p[i-1][k] * p[i-1][l] * (s[k] / (s[k] + s[l]));
                    p[i][l] += p[i-1][l] * p[i-1][k] * (s[l] / (s[k] + s[l]));
                }
            }
        }
    }

    return p[m][0];
}

void input() {
    cin >> m;
    for (int i = 0; i < (1<<m); i++) {        
        cin >> s[i];
        s[i] = s[i] * s[i];
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}