#include <bits/stdc++.h>
using namespace std;
const int MAXN = 205;
char A[MAXN + 5][MAXN + 5];
int B[MAXN + 5][MAXN + 5];
char s[5][MAXN + 5][MAXN + 5];
int n;
void Init() {
  cin >> n;
  for (int i = 1; i <= 4; i++) {
    for (int a = 1; a <= n; a++)
      for (int b = 1; b <= n; b++) cin >> s[i][a][b];
  }
}
void Change(int t) {
  for (int i = 1; i <= 2 * n; i++) {
    int a = 0;
    if (i & 1)
      a = t;
    else
      a = 1 ^ t;
    for (int j = 1; j <= 2 * n; j++) {
      if (j & 1)
        B[i][j] = a;
      else
        B[i][j] = 1 ^ a;
    }
  }
}
bool Check(int a, int b, int c, int d) {
  int vis[5];
  memset(vis, 0, sizeof(vis));
  vis[a]++, vis[b]++, vis[c]++, vis[d]++;
  bool check = true;
  for (int i = 1; i <= 4; i++)
    if (!vis[i]) check = false;
  return check;
}
void Add(int a, int b, int c, int d) {
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      A[i][j] = s[a][i][j];
      A[i][j + n] = s[b][i][j];
      A[i + n][j] = s[c][i][j];
      A[i + n][j + n] = s[d][i][j];
    }
}
void solve() {
  int Max = MAXN * MAXN;
  for (int t = 0; t <= 1; t++) {
    Change(t);
    for (int a = 1; a <= 4; a++)
      for (int b = 1; b <= 4; b++)
        for (int c = 1; c <= 4; c++)
          for (int d = 1; d <= 4; d++) {
            if (Check(a, b, c, d)) {
              Add(a, b, c, d);
              int sum = 0;
              for (int i = 1; i <= 2 * n; i++)
                for (int j = 1; j <= 2 * n; j++)
                  if (A[i][j] != B[i][j] + '0') sum++;
              Max = min(Max, sum);
            }
          }
  }
  cout << Max << endl;
}
int main() {
  Init();
  solve();
}
