#include <bits/stdc++.h>
using namespace std;
int n;
char mp[5][1005];
int a[5], b[1005];
int dp[1005][1 << 12];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= 4; i++) scanf("%I64d", &a[i]);
  for (int i = 1; i <= 4; i++) scanf("%s", mp[i] + 1);
  for (int i = 1; i <= 4; i++) {
    for (int j = 1; j <= n; j++) {
      b[j] += (mp[i][j] == '*') << (i - 1);
    }
  }
  memset(dp, 0x3f, sizeof dp);
  dp[1][b[1] + (b[2] << 4) + (b[3] << 8)] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = (1 << 12) - 1; j >= 0; j--) {
      if (dp[i][j] == 0x3f3f3f3f) continue;
      if ((j & 0xf) == 0) {
        int t = (j >> 4) + (b[i + 3] << 8);
        dp[i + 1][t] = min(dp[i + 1][t], dp[i][j]);
      }
      for (int k = 1; k < 4; k++) {
        for (int l = 0; l + k <= 4; l++) {
          int t = 0;
          for (int kk = 1; kk <= k; kk++) {
            t = t << 4;
            for (int ll = l; ll < l + k; ll++) {
              t += (1 << ll);
            }
          }
          t = j & ~t;
          dp[i][t] = min(dp[i][t], dp[i][j] + a[k]);
        }
      }
      dp[i + 1][0] = min(dp[i + 1][0], dp[i][j] + a[4]);
    }
  }
  printf("%d\n", dp[n][0]);
  return 0;
}
