#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 10, M = 1 << 4;
int n, x[N];
char s[4][N];
long long mem[N][M][M][M];
long long a[5];
long long dp(int i, int a1, int a2, int a3) {
  if (i >= n) return 0ll;
  long long &ret = mem[i][a1][a2][a3];
  if (ret != -1) return ret;
  if (a1 == 0) return ret = dp(i + 1, a2, a3, x[i + 3]);
  ret = a[4] + dp(i + 4, x[i + 4], x[i + 5], x[i + 6]);
  ret = min(ret, a[3] + dp(i, a1 & 8, a2 & 8, a3 & 8));
  ret = min(ret, a[3] + dp(i, a1 & 1, a2 & 1, a3 & 1));
  ret = min(ret, a[2] + dp(i, a1 & 12, a2 & 12, a3));
  ret = min(ret, a[2] + dp(i, a1 & 9, a2 & 9, a3));
  ret = min(ret, a[2] + dp(i, a1 & 3, a2 & 3, a3));
  ret = min(ret, a[1] + dp(i, a1 & 14, a2, a3));
  ret = min(ret, a[1] + dp(i, a1 & 13, a2, a3));
  ret = min(ret, a[1] + dp(i, a1 & 11, a2, a3));
  ret = min(ret, a[1] + dp(i, a1 & 7, a2, a3));
  return ret;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= 4; i++) scanf("%lld", a + i);
  for (int i = 0; i < 4; i++) scanf("%s", s[i]);
  for (int j = 0; j < 4; j++)
    for (int i = 0; i < n; i++) x[i] += ((s[j][i] == '*') << j);
  n += 5;
  memset(mem, -1, sizeof mem);
  printf("%lld\n", dp(0, x[0], x[1], x[2]));
  return 0;
}
