#include <bits/stdc++.h>
using namespace std;
constexpr int inf32 = 0x3f3f3f3f;
constexpr long long inf64 = 0x3f3f3f3f3f3f3f3f;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int n;
  cin >> n;
  vector<int> a(5);
  vector<string> mymap(4);
  for (int i = 1; i <= 4; ++i) cin >> a[i];
  for (int i = (4) - 1; i >= 0; --i) a[i] = min(a[i], a[i + 1]);
  vector<int> g(1 << 16, inf32);
  vector<pair<int, int> > trans;
  g[0] = 0;
  for (int s = 0; s < (1 << 16); ++s)
    if (g[s] != inf32) {
      trans.emplace_back(s, g[s]);
      for (int k = 1; k <= 4; ++k) {
        for (int l = 0; l < (5 - k); ++l) {
          int r = l + k, t = s;
          for (int i = l; i < r; ++i) {
            t = ~(~t | 15 << i * 4);
            t |= max(s >> i * 4 & 15, k) << i * 4;
          }
          g[t] = min(g[t], g[s] + a[k]);
        }
      }
    }
  for (int i = 0; i < (4); ++i) cin >> mymap[i];
  vector<vector<int> > f(n + 1, vector<int>(1 << 8, inf32));
  f[0][0] = 0;
  for (int i = 0; i < (n); ++i) {
    for (int s = 0; s < (1 << 8); ++s)
      if (f[i][s] != inf32) {
        for (pair<int, int> &u : trans) {
          int t = 0;
          for (int j = 0; j < (4); ++j) {
            int len = max(u.first >> j * 4 & 15, s >> j * 2 & 3);
            if (mymap[j][i] == '*' && !len) {
              t = -1;
              break;
            }
            t |= max(len - 1, 0) << j * 2;
          }
          if (!~t) continue;
          f[i + 1][t] = min(f[i + 1][t], f[i][s] + u.second);
        }
      }
  }
  int ns = inf32;
  for (int s = 0; s < (1 << 8); ++s) ns = min(ns, f[n][s]);
  cout << ns << '\n';
  return 0;
}
