#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, ans = 1000000007;
  cin >> n;
  int a[2][2 * n][2 * n], b[4][n][n], c[2 * n][2 * n];
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < 2 * n; j++) {
      for (int k = 0; k < 2 * n; k++) {
        a[i][j][k] = (i + j + k) % 2;
      }
    }
  }
  string s;
  vector<int> v;
  for (int i = 0; i < 4; i++) {
    v.push_back(i);
    for (int k = 0; k < n; k++) {
      cin >> s;
      for (int j = 0; j < n; j++) {
        b[i][k][j] = s[j] - '0';
      }
    }
  }
  do {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        c[i][j] = b[v[0]][i][j];
        c[i][j + n] = b[v[1]][i][j];
        c[i + n][j] = b[v[2]][i][j];
        c[i + n][j + n] = b[v[3]][i][j];
      }
    }
    int c1 = 0, c2 = 0;
    for (int i = 0; i < 2 * n; i++) {
      for (int j = 0; j < 2 * n; j++) {
        if (c[i][j] != a[0][i][j]) c1++;
        if (c[i][j] != a[1][i][j]) c2++;
      }
    }
    ans = min(ans, min(c1, c2));
  } while (next_permutation(v.begin(), v.end()));
  cout << ans;
}
