#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n, cost[5], g[5], f[N][1 << 12];
char str[5][N];
inline void up(int& x, int y) {
  if (x < 0 || y < x) x = y;
}
int main() {
  int i, j, k, a, b, c, d, A;
  scanf("%d", &n);
  for (i = 1; i <= 4; ++i) scanf("%d", &cost[i]);
  for (i = 1; i <= 4; ++i) scanf("%s", str[i] + 1);
  g[1] = 1, g[2] = 3 * (1 + 16), g[3] = 7 * (1 + 16 + 256),
  g[4] = (1 << 16) - 1;
  int s0 = 0;
  for (i = 1; i <= 4; ++i)
    for (j = 1; j <= 3; ++j)
      if (str[i][j] == '.') s0 |= 1 << ((j - 1) * 4 + i - 1);
  memset(f, 255, sizeof(f));
  f[0][s0] = 0;
  for (i = 0; i < n; ++i) {
    int sr = 0;
    for (j = 1; j <= 4; ++j)
      if (str[j][i + 4] == '.') sr |= 1 << (j - 1);
    for (A = 0; A < (1 << 12); ++A)
      if (~f[i][A]) {
        for (d = 0; d <= 4; ++d)
          for (c = 0; c <= 3; ++c)
            for (b = 0; b <= 2; ++b)
              for (a = 0; a <= 1; ++a) {
                int sumc = cost[a] + cost[b] + cost[c] + cost[d];
                int s0 = g[a] << (1 - a) | g[b] << (2 - b) | g[c] << (3 - c) |
                         g[d] << (4 - d);
                if ((A & 15 | s0 & 15) == 15)
                  up(f[i + 1][A >> 4 | s0 >> 4 | sr << 8], f[i][A] + sumc);
              }
      }
  }
  printf("%d", f[n][0]);
  return 0;
}
