#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
vector<int> a = {0, 1, 2, 3};
vector<vector<string>> x;
vector<string> y;
int n, asd, ans = INF;
void build() {
  for (int i = 0; i < 2 * n; i++) y[i].clear();
  for (int i = 0; i < n; i++) {
    for (auto j : x[a[0]][i]) y[i].push_back(j);
    for (auto j : x[a[1]][i]) y[i].push_back(j);
  }
  for (int i = n; i < 2 * n; i++) {
    for (auto j : x[a[2]][i - n]) y[i].push_back(j);
    for (auto j : x[a[3]][i - n]) y[i].push_back(j);
  }
}
int f(char ul) {
  build();
  int res = 0;
  for (int i = 0; i < 2 * n; i++) {
    for (int j = 0; j < 2 * n; j++) {
      if ((i + j) & 1) {
        if (y[i][j] == ul) res++;
      } else {
        if (y[i][j] != ul) res++;
      }
    }
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  x.resize(4);
  y.resize(2 * n);
  for (int i = 0; i < 4; i++) {
    x[i].resize(n);
    for (int j = 0; j < n; j++) cin >> x[i][j];
  }
  do {
    ans = min(ans, f('1'));
    ans = min(ans, f('0'));
  } while (next_permutation(a.begin(), a.end()));
  cout << ans << endl;
}
