import java.util.TreeSet;

public class Main {

  private static void solve() {
    int n = ni();
    int[] a = na(1 << n);

    int[][] g = new int[1 << n][2];
    for (int i = 0; i < (1 << n); i++) {
      g[i][0] = i;
      g[i][1] = -1;
    }

    TreeSet<Integer> set = new TreeSet<>((o1, o2) -> {
      if (a[o1] == a[o2])
        return o1 - o2;
      return a[o2] - a[o1];
    });

    for (int i = 0; i < n; i++) {
      for (int j = 0; j < (1 << n); j++) {
        if ((j & (1 << i)) != 0) {
          int[] s = g[j];
          int[] t = g[j ^ (1 << i)];

          set.clear();
          set.add(s[0]);
          set.add(t[0]);
          if (s[1] >= 0)
            set.add(s[1]);
          if (s[1] >= 0)
            set.add(t[1]);

          s[0] = set.pollFirst();
          s[1] = set.pollFirst();
        }
      }
    }

    int max = 0;
    for (int i = 1; i < (1 << n); i++) {
      max = Math.max(max, a[g[i][0]] + a[g[i][1]]);
      System.out.println(max);
    }
  }


  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = System.getProperty("debug");
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}


Measured memory_bytes: 200668