#include <bits/stdc++.h>
using namespace std;
const int INF = 40005;
int n, Min;
int num[5][105][105];
int ans[205][205];
void solve(int a, int b, int c, int d) {
  int cnt = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      ans[i][j] = num[a][i][j];
      ans[i][j + n] = num[b][i][j];
      ans[i + n][j] = num[c][i][j];
      ans[i + n][j + n] = num[d][i][j];
    }
  for (int i = 1; i <= 2 * n; i++) {
    for (int j = 1; j <= 2 * n; j++) {
      if (((i % 2 == 0) && (j % 2 == 0)) || ((i & 1) && (j & 1))) {
        if (ans[i][j] == 0) cnt++;
      } else {
        if (ans[i][j] == 1) cnt++;
      }
    }
  }
  Min = min(Min, cnt);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= 4; i++) {
    for (int j = 1; j <= n; j++)
      for (int k = 1; k <= n; k++) scanf("%1d", &num[i][j][k]);
  }
  Min = INF;
  for (int a = 1; a <= 4; a++) {
    for (int b = 1; b <= 4; b++) {
      if (a == b) continue;
      for (int c = 1; c <= 4; c++) {
        if (a == c || b == c) continue;
        for (int d = 1; d <= 4; d++) {
          if (a == d || b == d || c == d) continue;
          solve(a, b, c, d);
        }
      }
    }
  }
  printf("%d\n", Min);
  return 0;
}
