BOJ-2630

#include <iostream>

using namespace std;

int map[129][129] = {0};
int white, blue = 0;

void solve(int x, int y, int size) {
    int check = map[x][y];
    for (int i=x; i<x+size; i++)
        for (int j=y; j<y+size; j++) {
            if (check == 0 && map[i][j] == 1) check = 2;
            if (check == 1 && map[i][j] == 0) check = 2;
            if (check == 2) {
                solve(x, y, size/2);
                solve(x, y+size/2, size/2);
                solve(x+size/2, y, size/2);
                solve(x+size/2, y+size/2, size/2);
                return;
            }
        }
    if (check == 0) white+=1;
    if (check == 1) blue +=1;    
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int N; cin >> N;
    if (N!=2 && N!=4 && N!=8 && N!=16 && N!=32 && N!=64 && N!=128) return 0;
    for (int i=0; i<N; i++) 
        for (int j=0; j<N; j++)
            cin >> map[i][j];

    solve(0, 0, N);
    cout << white << "\n" << blue << "\n";
}