#include <bits/stdc++.h>
using namespace std;
int n, p[105][105][4], ans = 1e9;
char c;
int Try(int a, int b, int c, int d) {
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i % 2 == j % 2 && p[i][j][a] == 1) ans++;
      if (i % 2 != j % 2 && p[i][j][a] == 0) ans++;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i % 2 == j % 2 && p[i][j][b] == 1) ans++;
      if (i % 2 != j % 2 && p[i][j][b] == 0) ans++;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i % 2 == j % 2 && p[i][j][c] == 0) ans++;
      if (i % 2 != j % 2 && p[i][j][c] == 1) ans++;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i % 2 == j % 2 && p[i][j][d] == 0) ans++;
      if (i % 2 != j % 2 && p[i][j][d] == 1) ans++;
    }
  }
  return ans;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int k = 1; k <= 4; k++) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        cin >> c;
        p[i][j][k] = c - '0';
      }
    }
  }
  ans = min(ans, Try(1, 2, 3, 4));
  ans = min(ans, Try(1, 3, 2, 4));
  ans = min(ans, Try(1, 4, 3, 2));
  ans = min(ans, Try(2, 3, 1, 4));
  ans = min(ans, Try(2, 4, 1, 3));
  ans = min(ans, Try(3, 4, 1, 2));
  cout << ans << endl;
}
