#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, res = 1e9, a[5][N][N];
void calc(int a[N][N], int b[N][N], int c[N][N], int d[N][N]) {
  int tmp = 0, tmp2 = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      if (a[i][j] != (i + j) % 2)
        ++tmp;
      else
        ++tmp2;
      if (c[i][j] != (i + j) % 2)
        ++tmp;
      else
        ++tmp2;
      if (b[i][j] != (i + j) % 2)
        ++tmp2;
      else
        ++tmp;
      if (d[i][j] != (i + j) % 2)
        ++tmp2;
      else
        ++tmp;
    }
  res = min(res, min(tmp, tmp2));
}
int main() {
  cin >> n;
  for (int i = 1; i <= 4; ++i)
    for (int j = 1; j <= n; ++j)
      for (int k = 1; k <= n; ++k) {
        char z;
        cin >> z;
        a[i][j][k] = (int)(z - '0');
      }
  vector<int> v;
  v.push_back(1);
  v.push_back(2);
  v.push_back(3);
  v.push_back(4);
  do {
    calc(a[v[0]], a[v[1]], a[v[2]], a[v[3]]);
  } while (next_permutation(v.begin(), v.end()));
  cout << res << "\n";
}
