#include <bits/stdc++.h>
using namespace std;
const int oo = 1e9;
const int MAX = 100;
int n, a[4][MAX][MAX], b[MAX * 2][MAX * 2], idx[4], res, sum[2], flag;
char s[MAX + 1];
int main() {
  scanf("%d", &n);
  for (int tt = 0; tt < 4; ++tt)
    for (int i = 0; i < n; ++i) {
      scanf("%s", s);
      for (int j = 0; j < n; ++j) a[tt][i][j] = s[j] - '0';
    }
  for (int i = 0; i < 4; ++i) idx[i] = i;
  res = oo;
  do {
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < n; ++j) b[i][j] = a[idx[0]][i][j];
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < n; ++j) b[i][j + n] = a[idx[1]][i][j];
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < n; ++j) b[i + n][j] = a[idx[2]][i][j];
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < n; ++j) b[i + n][j + n] = a[idx[3]][i][j];
    sum[0] = sum[1] = 0;
    for (int i = 0; i < n * 2; ++i)
      for (int j = 0; j < n * 2; ++j) {
        flag = (i + j) & 1;
        sum[0] += (b[i][j] != flag);
        sum[1] += (b[i][j] != (1 - flag));
      }
    res = min(res, sum[0]);
    res = min(res, sum[1]);
  } while (next_permutation(idx, idx + 4));
  printf("%d", res);
  return 0;
}
