#include <bits/stdc++.h>
using namespace std;
int cost[5];
char buff[1005];
string arr[5];
int n = 4, m;
int DP[4][1001][1 << 4][1 << 4][1 << 4];
int mask[5][5][5];
int solve(int ind, int col, int m1, int m2, int m3) {
  if (ind && (m1 & (1 << (ind - 1)))) m1 -= 1 << (ind - 1);
  if (col == m) return 0;
  if (ind == n) return solve(0, col + 1, m2, m3, 0);
  int &temp = DP[ind][col][m1][m2][m3];
  if (temp != -1) return temp;
  temp = 2147483647;
  if ((m1 & (1 << ind)) || arr[ind][col] == '.') {
    temp = solve(ind + 1, col, m1, m2, m3);
  }
  for (int i = 1; i <= 3; i++) {
    if (ind + i > n || col + i > m) break;
    temp = min(temp,
               cost[i - 1] + solve(ind + 1, col, m1 | mask[ind][i][0],
                                   m2 | mask[ind][i][1], m3 | mask[ind][i][2]));
  }
  if (ind == 0 && col + 4 <= m) {
    temp = min(temp, cost[3] + solve(0, col + 1, mask[0][4][0], mask[0][4][1],
                                     mask[0][4][2]));
  }
  return temp;
}
int main() {
  cin >> m;
  for (int i = 0; i < n; i++) scanf("%d", &cost[i]);
  for (int i = 0; i < n; i++) {
    scanf("%s", buff);
    arr[i] = string(buff);
  }
  for (int i = 1; i <= 4; i++) {
    int tmp = (1 << i) - 1;
    for (int j = 0; j < 4; j++) {
      if (j + i > 4) break;
      for (int k = 0; k < i; k++) mask[j][i][k] = tmp;
      tmp *= 2;
    }
  }
  memset(DP, -1, sizeof(DP));
  cout << solve(0, 0, 0, 0, 0);
  return 0;
}
