#include <bits/stdc++.h>
using namespace std;
const int N = 109;
int n;
string a[4][N];
int main() {
  cin >> n;
  for (int k = 0; k < 4; ++k)
    for (int i = 0; i < n; ++i) {
      cin >> a[k][i];
      for (int j = 0; j < n; ++j) a[k][i][j] -= '0';
    }
  vector<int> v;
  for (int k = 0; k < 4; ++k) {
    int sum = 0;
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < n; ++j)
        if ((i + j) % 2 != a[k][i][j]) ++sum;
    v.push_back(sum);
  }
  int res = int(1e9);
  vector<int> perm;
  for (int k = 0; k < 4; ++k) perm.push_back(k);
  do {
    int sum = 0;
    for (int k = 0; k < 4; ++k) {
      int id = perm[k];
      if (k & 1)
        sum += v[id];
      else
        sum += n * n - v[id];
    }
    res = min(res, sum);
  } while (next_permutation(perm.begin(), perm.end()));
  cout << res << endl;
}
