#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const long long INF = 1LL << 60;
int n;
string P_one, P_zero;
struct Chess {
  char s[105][105];
};
Chess C[5];
void Init() {
  for (int i = 1; i <= 4; i++) {
    for (int j = 1; j <= n; j++) {
      scanf("%s", C[i].s[j]);
    }
  }
}
void get_P() {
  P_one = "";
  P_zero = "";
  bool f = 1;
  for (int i = 0; i < n; i++) {
    P_one += (char)('0' + f);
    P_zero += (char)('0' + (f ^ 1));
    f = f ^ 1;
  }
}
bool check(int x) {
  int one = 0;
  for (int i = 0; i < 4; i++)
    if ((x & (1 << i))) one++;
  if (one == 2)
    return true;
  else
    return false;
}
int cal(int pos, string P) {
  int change = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < n; j++)
      if (C[pos].s[i][j] != P[j]) change++;
    for (int j = 0; j < n; j++) {
      if (P[j] == '0')
        P[j] = '1';
      else if (P[j] == '1')
        P[j] = '0';
    }
  }
  return change;
}
int solve(int x) {
  int cnt = 0;
  for (int i = 0; i < 4; i++) {
    if ((x & (1 << i)) > 0) {
      cnt += cal(4 - i, P_one);
    } else {
      cnt += cal(4 - i, P_zero);
    }
  }
  return cnt;
}
int main() {
  while (scanf("%d", &n) != EOF) {
    Init();
    get_P();
    int ans = inf;
    for (int i = 0; i < (1 << 4); i++) {
      if (check(i)) {
        ans = min(ans, solve(i));
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}
