#include <bits/stdc++.h>
using namespace std;
const int maxn = 1002;
int f[maxn][(1 << 16)];
char s[5][maxn];
int a[5];
int M[5][5];
int cal(int i, int j) {
  int ans = 0;
  int k = j;
  while (k--) {
    for (int jj = 0; jj < j; jj++) ans |= (1 << i + jj);
    i += 4;
  }
  return ans;
}
void init() {
  for (int i = 0; i < 4; i++) {
    for (int j = 1; j <= 4; j++) {
      M[i][j] = cal(i, j);
    }
  }
}
int main() {
  init();
  int n;
  cin >> n;
  for (int i = 1; i <= 4; i++) scanf("%d", a + i);
  for (int i = 1; i <= 4; i++) scanf("%s", s[i]);
  memset(f, 0x3f, sizeof(f));
  int mask = 0;
  for (int i = 0; i < 4; i++) {
    for (int j = 1; j <= 4; j++)
      if (s[j][i] == '.') mask |= (1 << (j - 1 + 4 * i));
  }
  f[1][mask] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < 4; j++) {
      for (int k = 4 - j; k > 0; k--) {
        for (int m = (1 << 16) - 1; m >= 0; m--) {
          f[i][m | M[j][k]] = min(f[i][m | M[j][k]], f[i][m] + a[k]);
        }
      }
    }
    mask = 0;
    if (i + 3 < n)
      for (int j = 1; j <= 4; j++)
        if (s[j][i + 3] == '.') mask += (1 << j - 1);
    mask <<= 12;
    for (int t = (1 << 12) - 1; t >= 0; t--) {
      int m = (t << 4) + 15;
      f[i + 1][(m >> 4) + mask] = min(f[i + 1][(m >> 4) + mask], f[i][m]);
      assert((m >> 4) + mask < (1 << 16));
    }
  }
  printf("%d\n", f[n][15]);
}
