#include <bits/stdc++.h>
using namespace std;
int dp[2][1 << 15], mat[5], w[5], n;
bool s[1010][5];
char ch[1010];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= 4; i++) scanf("%d", &w[i]);
  for (int i = 1; i <= 4; i++) {
    scanf("%s", ch);
    for (int j = 0; j < n; j++) s[j + 1][i] = ch[j] == '.';
  }
  int s0 = 0;
  mat[1] = 1;
  mat[2] = 51;
  mat[3] = 1911;
  mat[4] = 65535;
  memset(dp, 0x3f3f3f3f, sizeof(dp));
  for (int i = 1; i <= 4; i++)
    for (int j = 1; j <= 3; j++)
      if (s[j][i]) s0 |= 1 << ((j - 1) * 4 + i - 1);
  int cur = 1, pre = 0;
  dp[pre][s0] = 0;
  w[0] = 0;
  for (int i = 0; i < n; i++) {
    int nxt = 0;
    memset(dp[cur], 0x3f3f3f3f, sizeof(dp[cur]));
    for (int j = 1; j <= 4; j++)
      if (s[i + 4][j]) nxt |= 1 << j - 1;
    for (int st = 0; st < (1 << 12); st++) {
      if (dp[pre][st] == 0x3f3f3f3f) continue;
      for (int a = 0; a <= 4; a++)
        for (int b = 0; b <= 3; b++)
          for (int c = 0; c <= 2; c++)
            for (int d = 0; d <= 1; d++) {
              int cost = w[a] + w[b] + w[c] + w[d];
              int add = mat[a] << (4 - a) | mat[b] << (3 - b) |
                        mat[c] << (2 - c) | mat[d] << (1 - d);
              if (((st | add) & 15) == 15) {
                int nxt_st = (st >> 4) | (add >> 4) | (nxt << 8);
                dp[cur][nxt_st] = min(dp[cur][nxt_st], dp[pre][st] + cost);
              }
            }
    }
    swap(cur, pre);
  }
  cout << dp[pre][0] << endl;
  return 0;
}
