#include <bits/stdc++.h>
using namespace std;
char s[1005];
int n, ans, cnt, msk, f[1005][(1 << 16) + 2], a[6][1005], c[10], g[10];
int rev(int x) { return x ^ ((1 << 16) - 1); }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= 4; i++) scanf("%d", &c[i]);
  for (int i = 1; i <= 4; i++) {
    scanf("%s", s + 1);
    for (int j = 1; j <= n; j++) a[i][j] = (s[j] == '*');
  }
  for (int i = 0; i <= n; i++)
    for (int j = 0; j < (1 << 16); j++) f[i][j] = 1e9 + 7;
  cnt = -1;
  msk = 0;
  for (int i = 1; i <= 4; i++)
    for (int j = 1; j <= 4; j++) {
      cnt++;
      if (a[j][i]) msk |= (1 << cnt);
    }
  f[0][msk] = 0;
  g[0] = 0;
  g[1] = 1;
  g[2] = (1 << 0) ^ (1 << 1) ^ (1 << 4) ^ (1 << 5);
  g[3] = (1 << 0) ^ (1 << 1) ^ (1 << 2) ^ (1 << 4) ^ (1 << 5) ^ (1 << 6) ^
         (1 << 8) ^ (1 << 9) ^ (1 << 10);
  g[4] = (1 << 16) - 1;
  for (int k = 0; k <= n; k++) {
    int del = 0;
    for (int j = 1; j <= 4; j++)
      if (a[j][k + 5]) del |= (1 << (j + 11));
    for (int j = 0; j < (1 << 16); j++) {
      if (f[k][j] >= 1e9 + 7) continue;
      for (int aa = 0; aa <= 4; aa++)
        for (int bb = 0; bb <= 3; bb++)
          for (int cc = 0; cc <= 2; cc++)
            for (int dd = 0; dd <= 1; dd++) {
              int cnt = rev(g[aa]) & rev(g[bb] << 1) & rev(g[cc] << 2) &
                        rev(g[dd] << 3);
              if ((cnt & j & 15) == 0) {
                int nw = cnt & j;
                nw >>= 4;
                nw ^= del;
                f[k + 1][nw] =
                    min(f[k + 1][nw], f[k][j] + c[aa] + c[bb] + c[cc] + c[dd]);
              }
            }
    }
  }
  ans = 1e9 + 7;
  for (int i = n - 4; i <= n; i++) ans = min(ans, f[i][0]);
  printf("%d\n", ans);
  return 0;
}
