Problem: The annual college sports-ball tournament is approaching, which for trademark reasons we'll refer to as Third Month Insanity. There are a total of 2N teams participating in the tournament, numbered from 1 to 2N. The tournament lasts N rounds, with each round eliminating half the teams. The first round consists of 2N - 1 games, numbered starting from 1. In game i, team 2·i - 1 will play against team 2·i. The loser is eliminated and the winner advances to the next round (there are no ties). Each subsequent round has half as many games as the previous round, and in game i the winner of the previous round's game 2·i - 1 will play against the winner of the previous round's game 2·i.

Every year the office has a pool to see who can create the best bracket. A bracket is a set of winner predictions for every game. For games in the first round you may predict either team to win, but for games in later rounds the winner you predict must also be predicted as a winner in the previous round. Note that the bracket is fully constructed before any games are actually played. Correct predictions in the first round are worth 1 point, and correct predictions in each subsequent round are worth twice as many points as the previous, so correct predictions in the final game are worth 2N - 1 points.

For every pair of teams in the league, you have estimated the probability of each team winning if they play against each other. Now you want to construct a bracket with the maximum possible expected score.

Input

Input will begin with a line containing N (2 ≤ N ≤ 6).

2N lines follow, each with 2N integers. The j-th column of the i-th row indicates the percentage chance that team i will defeat team j, unless i = j, in which case the value will be 0. It is guaranteed that the i-th column of the j-th row plus the j-th column of the i-th row will add to exactly 100.

Output

Print the maximum possible expected score over all possible brackets. Your answer must be correct to within an absolute or relative error of 10 - 9.

Formally, let your answer be a, and the jury's answer be b. Your answer will be considered correct, if <image>.

Examples

Input

2
0 40 100 100
60 0 40 40
0 60 0 45
0 60 55 0


Output

1.75


Input

3
0 0 100 0 100 0 0 0
100 0 100 0 0 0 100 100
0 0 0 100 100 0 0 0
100 100 0 0 0 0 100 100
0 100 0 100 0 0 100 0
100 100 100 100 100 0 0 0
100 0 100 0 0 100 0 0
100 0 100 0 100 100 100 0


Output

12


Input

2
0 21 41 26
79 0 97 33
59 3 0 91
74 67 9 0


Output

3.141592

Note

In the first example, you should predict teams 1 and 4 to win in round 1, and team 1 to win in round 2. Recall that the winner you predict in round 2 must also be predicted as a winner in round 1.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, o = 1;
  char ch = getchar();
  while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
  if (ch == '-') o = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * o;
}
const int N = 105;
double p[N][N], w[N * 10][N], f[N * 10][N];
inline void dfs(int root, int l, int r, int val) {
  if (l == r) {
    w[root][l] = 1;
    f[root][l] = val;
    return;
  }
  int mid = (l + r) >> 1;
  dfs(root << 1, l, mid, val / 2);
  dfs(root << 1 | 1, mid + 1, r, val / 2);
  for (int i = l; i <= mid; ++i)
    for (int j = mid + 1; j <= r; ++j) {
      w[root][i] += w[root << 1][i] * w[root << 1 | 1][j] * p[i][j];
    }
  for (int i = mid + 1; i <= r; ++i)
    for (int j = l; j <= mid; ++j) {
      w[root][i] += w[root << 1][j] * w[root << 1 | 1][i] * p[i][j];
    }
  for (int i = l; i <= mid; ++i)
    for (int j = mid + 1; j <= r; ++j) {
      f[root][i] = max(
          f[root][i], w[root][i] * val + f[root << 1][i] + f[root << 1 | 1][j]);
    }
  for (int i = mid + 1; i <= r; ++i)
    for (int j = l; j <= mid; ++j) {
      f[root][i] = max(
          f[root][i], w[root][i] * val + f[root << 1][j] + f[root << 1 | 1][i]);
    }
}
int main() {
  int n = read();
  n = 1 << n;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      int x = read();
      p[i][j] = 0.01 * x;
    }
  }
  dfs(1, 1, n, n / 2);
  double ans = 0.0;
  for (int i = 1; i <= n; ++i) ans = max(ans, f[1][i]);
  printf("%.10lf\n", ans);
  return 0;
}