#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, a[4];
char s[4][N];
inline int ml(int i) {
  int ans = 0;
  for (int j = int(0); j < int(4); j++) ans |= (s[j][i] << j);
  return ans;
}
vector<int> v;
inline int index(int x) {
  if (x == 1) return 0;
  if (x == 4) return 1;
  if (x == 9) return 2;
  if (x == 16) return 3;
  assert(0);
}
int dp[N][1 << 12];
int f(int i, int bit) {
  int &ans = dp[i][bit];
  if (~ans) return ans;
  ans = 1000000000;
  if (i == n && !bit) return ans = 0;
  int mbit = bit | (ml(i) << 12), nbit, id;
  if ((mbit & 15) == 0) ans = min(ans, f(min(n, i + 1), mbit >> 4));
  for (int j = int(0); j < int(v.size()); j++) {
    nbit = mbit & ~v[j];
    id = index(__builtin_popcount(v[j]));
    if (nbit == mbit) continue;
    if (nbit & 15)
      ans = min(ans, a[id] + f(i, nbit & ~0xf000));
    else
      ans = min(ans, a[id] + f(min(n, i + 1), nbit >> 4));
  }
  return ans;
}
int main() {
  memset(dp, -1, sizeof dp);
  scanf("%d", &n);
  for (int j = int(0); j < int(4); j++) scanf("%d", a + j);
  for (int j = int(0); j < int(4); j++) scanf(" %s", s[j]);
  for (int j = int(0); j < int(4); j++)
    for (int i = int(0); i < int(n); i++) s[j][i] = s[j][i] == '*';
  v.push_back(0x1), v.push_back(0x2), v.push_back(0x4), v.push_back(0x8);
  v.push_back(0x33), v.push_back(0x66), v.push_back(0xcc);
  v.push_back(0x777), v.push_back(0xeee);
  v.push_back(0xffff);
  printf("%d\n", f(3, ml(0) | (ml(1) << 4) | (ml(2) << 8)));
  return 0;
}
