#include <bits/stdc++.h>
using namespace std;
long long int x, y;
long long int gcd(long long int a, long long int b) {
  if (a == 0) {
    x = 0, y = 1;
    return b;
  }
  long long int gc = gcd(b % a, a);
  long long int temp;
  temp = x;
  x = y - (b / a) * temp;
  y = temp;
  return gc;
}
long long int po(long long int a, long long int x, long long int m) {
  if (x == 0) {
    return 1;
  }
  long long int ans = 1, k = 1;
  while (k <= x) {
    if (x & k) {
      ans = ((ans * a) % m);
    }
    k <<= 1;
    a *= a;
    a %= m;
  }
  return ans;
}
int val[67][67];
int cn = 1;
vector<pair<double, double> > a[5000];
void solve(int node, int n, int size) {
  if (size == 2) {
    a[node].push_back({val[n][n + 1] / 100.0, val[n][n + 1] / 100.0});
    a[node].push_back({val[n + 1][n] / 100.0, val[n + 1][n] / 100.0});
    return;
  }
  int l, r;
  cn++;
  l = cn;
  solve(cn, n, size >> 1);
  cn++;
  r = cn;
  solve(cn, n + (size >> 1), size >> 1);
  int i, j;
  double a1, a2;
  double ma;
  double temp;
  int k = -1;
  for (i = 0; i < (size >> 1); i++) {
    a1 = a[l][i].first;
    a2 = a[l][i].second;
    ma = 0;
    k = -1;
    temp = 0;
    for (j = 0; j < (size >> 1); j++) {
      temp += a1 * (val[n + i][n + (size >> 1) + j] / 100.0) * a[r][j].first;
      if (ma <= a[r][j].second) {
        ma = a[r][j].second;
      }
    }
    a1 = temp;
    a2 += ma;
    a2 += temp * (size >> 1);
    a[node].push_back({a1, a2});
  }
  for (i = 0; i < (size >> 1); i++) {
    a1 = a[r][i].first;
    a2 = a[r][i].second;
    ma = 0;
    k = -1;
    temp = 0;
    for (j = 0; j < (size >> 1); j++) {
      temp += a1 * (val[n + (size >> 1) + i][n + j] / 100.0) * a[l][j].first;
      if (ma <= a[l][j].second) {
        ma = a[l][j].second;
      }
    }
    a1 = temp;
    a2 += ma;
    a2 += temp * (size >> 1);
    a[node].push_back({a1, a2});
  }
}
int main() {
  ios::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  int n;
  cin >> n;
  int i, j;
  for (i = 1; i <= (1 << n); i++) {
    for (j = 1; j <= (1 << n); j++) cin >> val[i][j];
  }
  solve(1, 1, 1 << n);
  double ma = 0;
  for (i = 0; i < (1 << n); i++) {
    ma = max(a[1][i].second, ma);
  }
  printf("%.9lf", ma);
}
