#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
int n, p2;
double prob[66][66];
double pp[9][66];
int p[] = {1, 2, 4, 8, 16, 32, 64, 128};
double pd[] = {1.0, 2.0, 4.0, 8.0, 16.0, 32.0, 64.0, 128.0};
double dp[256][66];
bool vis[256][66];
double call(int node, int b, int e, int taken, int level) {
  if (b == e) return 0;
  if (vis[node][taken]) return dp[node][taken];
  int mid = (b + e) / 2;
  double ret = 0;
  if (b <= taken && taken <= e)
    ret = call(2 * node, b, mid, taken, level - 1) +
          call(2 * node + 1, mid + 1, e, taken, level - 1);
  else {
    for (int i = (b); i <= (e); i++) {
      ret = max(ret, pp[level][i] + call(2 * node, b, mid, i, level - 1) +
                         call(2 * node + 1, mid + 1, e, i, level - 1));
    }
  }
  vis[node][taken] = 1;
  return dp[node][taken] = ret;
}
int main() {
  scanf("%d", &n);
  p2 = 1;
  for (int i = (1); i <= (n); i++) p2 *= 2;
  for (int i = (1); i <= (p2); i++) {
    for (int j = (1); j <= (p2); j++) {
      scanf("%lf", &prob[i][j]);
      prob[i][j] /= 100.0;
    }
  }
  for (int i = (1); i <= (p2); i++) pp[1][i] = 1;
  for (int i = (2); i <= (n + 1); i++) {
    int now = 1;
    while (now <= p2) {
      for (int j = (now); j <= (now + p[i - 2] - 1); j++) {
        pp[i][j] = 0;
        for (int k = (now + p[i - 2]); k <= (now + p[i - 1] - 1); k++) {
          pp[i][j] += pp[i - 1][j] * pp[i - 1][k] * prob[j][k];
        }
      }
      for (int j = (now + p[i - 2]); j <= (now + p[i - 1] - 1); j++) {
        pp[i][j] = 0;
        for (int k = (now); k <= (now + p[i - 2] - 1); k++)
          pp[i][j] += pp[i - 1][j] * pp[i - 1][k] * prob[j][k];
      }
      now += p[i - 1];
    }
  }
  for (int i = (1); i <= (p2); i++) pp[1][i] = 0;
  for (int i = (2); i <= (n + 1); i++) {
    for (int j = (1); j <= (p2); j++)
      pp[i][j] = pp[i][j] * pd[i - 2] + pp[i - 1][j];
  }
  memset(vis, 0, sizeof(vis));
  double ans = call(1, 1, p2, 0, n + 1);
  cout << setprecision(12) << fixed << ans << "\n";
  return 0;
}
