#include <bits/stdc++.h>
using namespace std;
const int N = 102, M = 1000000007, BIG = 0x3f3f3f3f;
int n;
int a[4][N][N];
int cost[2][4];
bool Read() {
  cin >> n;
  if (cin.eof()) return 0;
  char c;
  for (int k = 0; k < 4; k++)
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++) {
        cin >> c;
        a[k][i][j] = c - '0';
      }
  return 1;
}
void Process() {
  memset(cost, 0, sizeof cost);
  for (int k = 0; k < 4; k++)
    for (int turn = 0; turn < 2; turn++) {
      bool cur = turn;
      for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++, cur = !cur)
          if (a[k][i][j] != cur) cost[turn][k]++;
    }
  int ans = BIG, cur = 0;
  for (int i = 0; i < 4; i++)
    for (int j = i + 1; j < 4; j++) {
      cur = cost[1][i] + cost[1][j];
      for (int k = 0; k < 4; k++)
        if (k != i && k != j) cur += cost[0][k];
      ans = min(ans, cur);
    }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  while (Read()) Process();
  return 0;
}
