#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3fll;
const long long M = 1e9 + 7;
const long long maxn = 1e6 + 7;
const double eps = 0.00000001;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <typename T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <typename T>
inline T powMM(T a, T b) {
  T ret = 1;
  for (; b; b >>= 1ll, a = 1ll * a * a % M)
    if (b & 1) ret = 1ll * ret * a % M;
  return ret;
}
int n, a1, a2, a3, a4;
int i, j, k;
int a[maxn];
int f[maxn], g[maxn];
int main() {
  scanf("%d%d%d%d%d", &n, &a1, &a2, &a3, &a4);
  for (k = 0; k < 4; k++)
    for (i = 0; i < n; i++) {
      char c;
      do c = getchar();
      while (c != '.' && c != '*');
      a[i] = a[i] * 2 + (c == '*');
    }
  for (i = 0; i < n; i++) {
    for (j = 0; j < (1 << 16); j++) g[j] = f[j], f[j] = INF;
    for (j = 0; j < (1 << 12); j++) f[j << 4 | a[i]] = g[j];
    for (j = (1 << 16) - 1; j >= 0; j--) {
      f[j & (~65535)] = min(f[j & (~65535)], f[j] + a4);
      f[j & (~1911)] = min(f[j & (~1911)], f[j] + a3);
      f[j & (~3822)] = min(f[j & (~3822)], f[j] + a3);
      f[j & (~51)] = min(f[j & (~51)], f[j] + a2);
      f[j & (~102)] = min(f[j & (~102)], f[j] + a2);
      f[j & (~204)] = min(f[j & (~204)], f[j] + a2);
      f[j & (~1)] = min(f[j & (~1)], f[j] + a1);
      f[j & (~2)] = min(f[j & (~2)], f[j] + a1);
      f[j & (~4)] = min(f[j & (~4)], f[j] + a1);
      f[j & (~8)] = min(f[j & (~8)], f[j] + a1);
    }
  }
  printf("%d\n", f[0]);
}
