#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
bool check(int mask, int pos) { return mask & (1 << pos); }
int SET(int mask, int pos) { return mask | (1 << pos); }
int FLIP(int mask, int pos) { return mask ^ (1 << pos); }
int reset(int mask, int pos) { return mask & ~(1 << pos); }
int n, a[5];
string str[10];
int mask[1005];
int dp[1005][16][16][16][16];
int solve(int pos, int cur1, int cur2, int cur3, int cur4) {
  if (pos == n) {
    return 0;
  }
  int &ret = dp[pos][cur1][cur2][cur3][cur4];
  if (ret != -1) {
    return ret;
  }
  ret = 100000000;
  if (cur1 == 0) {
    return ret = solve(pos + 1, cur2, cur3, cur4, mask[pos + 4]);
  }
  for (int sagol = 0; sagol < 4; sagol++) {
    for (int sz = 1; sz <= 4; sz++) {
      if (sagol + sz > 4) break;
      int tmp[] = {cur1, cur2, cur3, cur4};
      for (int i = 0; i < sz; i++) {
        for (int j = 0; j < sz; j++) {
          tmp[i] = reset(tmp[i], j + sagol);
        }
      }
      if (cur1 != tmp[0] || cur2 != tmp[1] || cur3 != tmp[2] || cur4 != tmp[3])
        ret = min(ret, solve(pos, tmp[0], tmp[1], tmp[2], tmp[3]) + a[sz]);
    }
  }
  return ret;
}
int main() {
  cin >> n;
  for (int i = 1; i <= 4; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < 4; i++) {
    cin >> str[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 4; j++) {
      if (str[j][i] == '*') {
        mask[i] = SET(mask[i], j);
      }
    }
  }
  memset(dp, -1, sizeof dp);
  cout << solve(0, mask[0], mask[1], mask[2], mask[3]) << '\n';
}
