题解 | #压缩二维码#

import java.io.*;
import java.util.*;
import java.math.BigInteger;

public class Main {
    static void solve() {
        int m = in.nextInt();
        int n = (int)Math.pow(2,m);
        int ans = 0, cnt = 0;
        for(int i=0;i<n;i++) {
            String s = in.next();
            for(int j=0;j<s.length();j++) {
                if(s.charAt(j)=='#') {
                    ans += Math.pow(2,3-cnt);
                }
                cnt++;
                if(cnt==4) {
                    out.print(ans+" ");
                    ans = 0;
                    cnt = 0;
                }
            }
        }
    }

    public static void main(String[] args) {
        solve();
        out.flush();
    }

    static FastReader in = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);

    static class FastReader {
        static BufferedReader br;
        static StringTokenizer st;

        FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            String str = "";
            while(st==null||!st.hasMoreElements()) {
                try {
                    str = br.readLine();
                }catch(IOException e) {
                    throw new RuntimeException(e);
                }
                st = new StringTokenizer(str);
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }
}