#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 2;
long long int count(string str[], long long int n) {
  long long int i, j, ans = 0, c1 = 0, c2 = 0;
  for (i = 0; i < 2 * n; ++i) {
    for (j = 0; j < 2 * n; ++j) {
      if ((i + j) % 2 == 0 && (str[i][j] == '1')) ++c1;
      if ((i + j) % 2 == 1 && (str[i][j] == '0')) ++c1;
    }
  }
  for (i = 0; i < 2 * n; ++i) {
    for (j = 0; j < 2 * n; ++j) {
      if ((i + j) % 2 == 0 && str[i][j] == '0') c2++;
      if ((i + j) % 2 == 1 && str[i][j] == '1') ++c2;
    }
  }
  ans = min(c1, c2);
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int i, j, k, l, m, n, anss = LONG_LONG_MAX, one = 0, zero = 0;
  cin >> n;
  string str[5][300];
  for (i = 1; i <= 4; ++i) {
    for (j = 0; j < n; ++j) cin >> str[i][j];
  }
  for (i = 1; i <= 4; ++i) {
    for (j = 1; j <= 4; ++j) {
      for (k = 1; k <= 4; ++k) {
        for (l = 1; l <= 4; ++l) {
          if (i != j && i != k && i != l && j != k && j != l & k != l) {
            string ans[509];
            for (m = 0; m < n; ++m) ans[m] += str[i][m];
            for (m = 0; m < n; ++m) ans[m] += str[j][m];
            for (m = n; m < 2 * n; ++m) ans[m] += str[k][m - n];
            for (m = n; m < 2 * n; ++m) ans[m] += str[l][m - n];
            anss = min(count(ans, n), anss);
          }
        }
      }
    }
  }
  cout << anss;
}
