#include <bits/stdc++.h>
using namespace std;
long long t, n, m;
long long chess[1111][1111];
long long a[10][111][111];
string s;
long long solve(int p, int q, int r, int s, int val) {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      chess[i][j] = a[p][i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      chess[i + n][j] = a[q][i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      chess[i + n][j + n] = a[r][i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      chess[i][j + n] = a[s][i][j];
    }
  }
  long long ret = 0;
  if (chess[0][0] != val) {
    chess[0][0] = val;
    ret++;
  }
  for (int i = 0; i < 2 * n; i++) {
    for (int j = 0; j < 2 * n; j++) {
      if (i == 0 && j == 0)
        continue;
      else if (j == 0) {
        if (chess[i][j] == chess[i - 1][j]) {
          ret++;
          chess[i][j] = !chess[i - 1][j];
        }
      } else {
        if (chess[i][j] == chess[i][j - 1]) {
          ret++;
          chess[i][j] = !chess[i][j - 1];
        }
      }
    }
  }
  return ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      char ch;
      cin >> ch;
      if (ch == '1')
        a[0][i][j] = 1;
      else
        a[0][i][j] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      char ch;
      cin >> ch;
      if (ch == '1')
        a[1][i][j] = 1;
      else
        a[1][i][j] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      char ch;
      cin >> ch;
      if (ch == '1')
        a[2][i][j] = 1;
      else
        a[2][i][j] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      char ch;
      cin >> ch;
      if (ch == '1')
        a[3][i][j] = 1;
      else
        a[3][i][j] = 0;
    }
  }
  vector<int> perm;
  long long ans = LONG_LONG_MAX;
  perm.push_back(0);
  perm.push_back(1);
  perm.push_back(2);
  perm.push_back(3);
  do {
    ans = min(ans, solve(perm[0], perm[1], perm[2], perm[3], 1));
    ans = min(ans, solve(perm[0], perm[1], perm[2], perm[3], 0));
  } while (next_permutation(perm.begin(), perm.end()));
  cout << ans << "\n";
  return 0;
}
