#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
const long long INF = 1e16 + 7;
char ff[5][N];
int cost[5];
long long DP[N][5][1 << 8];
long long fun(int n, int p, int fill) {
  if (DP[n][p][fill] != -1) return DP[n][p][fill];
  if (n == 0) {
    if (fill)
      return DP[n][p][fill] = INF;
    else
      return DP[n][p][fill] = 0;
  }
  if (p == 0) return DP[n][p][fill] = fun(n - 1, 4, fill);
  bitset<8> bs(fill);
  long long ans = INF;
  int f = (p << 1) - 2;
  int s = f + 1;
  int msk = (bs[f] << 1) + bs[s];
  if (ff[p][n] == '.' || bs[f] || bs[s]) {
    int tmsk = max(0, msk - 1);
    bitset<8> ts = bs;
    ts[f] = tmsk >> 1;
    ts[s] = tmsk % 2;
    ans = min(ans, fun(n, p - 1, ts.to_ulong()));
  }
  for (int j = 1; j <= p; j++) {
    bitset<8> ts = bs;
    int ff = f, ss = s;
    for (int k = p; k > p - j; k--) {
      int msk = (bs[ff] << 1) + bs[ss];
      int tmsk = max(msk, j);
      if (j == p || k == p) tmsk--;
      ts[ff] = tmsk >> 1;
      ts[ss] = tmsk % 2;
      ff -= 2;
      ss = ff + 1;
    }
    if (j == p)
      ans = min(ans, cost[j] + fun(n, p - j, ts.to_ulong()));
    else
      ans = min(ans, cost[j] + fun(n, p - 1, ts.to_ulong()));
  }
  return DP[n][p][fill] = ans;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= 4; i++) {
    scanf("%d", &cost[i]);
  }
  for (int i = 1; i <= 4; i++) {
    for (int j = 1; j <= n; j++) {
      scanf(" %c", &ff[i][j]);
    }
  }
  memset(DP, -1, sizeof DP);
  printf("%lld\n", fun(n, 4, 0));
  return 0;
}
