#include <bits/stdc++.h>
using namespace std;
bool check(string a[], int n) {
  int t;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (!i && !j)
        t = a[i][j];
      else {
        if (a[i][j] == t)
          return 0;
        else
          t = a[i][j];
      }
    }
  }
  return 1;
}
int correct(string a[], int n) {
  int t, c = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (!i && !j)
        t = a[i][j];
      else {
        if (a[i][j] == t) {
          a[i][j] = !(t - '0') + '0';
          c++;
          t = a[i][j];
        } else
          t = a[i][j];
      }
    }
  }
  return c;
}
bool comp(pair<int, int> a, pair<int, int> b) {
  if (a.first < b.first)
    return 1;
  else
    return 0;
}
int main() {
  int n;
  cin >> n;
  string a[n], b[n], c[n], d[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) cin >> b[i];
  for (int i = 0; i < n; i++) cin >> c[i];
  for (int i = 0; i < n; i++) cin >> d[i];
  bool val[4];
  val[0] = check(a, n);
  val[1] = check(b, n);
  val[2] = check(c, n);
  val[3] = check(d, n);
  int x, y, z, w;
  x = y = z = w = 0;
  if (!val[0]) {
    x = correct(a, n);
  }
  if (!val[1]) {
    y = correct(b, n);
  }
  if (!val[2]) {
    z = correct(c, n);
  }
  if (!val[3]) {
    w = correct(d, n);
  }
  vector<pair<int, int>> v;
  v.push_back(make_pair(x, a[0][0]));
  v.push_back(make_pair(y, b[0][0]));
  v.push_back(make_pair(z, c[0][0]));
  v.push_back(make_pair(w, d[0][0]));
  v.push_back(make_pair(n * n - x, !(a[0][0] - '0') + '0'));
  v.push_back(make_pair(n * n - y, !(b[0][0] - '0') + '0'));
  v.push_back(make_pair(n * n - z, !(c[0][0] - '0') + '0'));
  v.push_back(make_pair(n * n - w, !(d[0][0] - '0') + '0'));
  sort(v.begin(), v.end(), comp);
  int ones[4], zeros[4], q = 0, e = 0;
  for (int i = 0; i < 8; i++) {
    if (v[i].second == '0')
      zeros[e++] = i;
    else
      ones[q++] = i;
  }
  cout << v[ones[0]].first + v[ones[1]].first + v[zeros[0]].first +
              v[zeros[1]].first;
}
