#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
const int inf = (int)1e9 + 1;
const long long big = (long long)1e18 + 1;
const int P = 239;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const long double eps = 1e-9;
const long double pi = atan2(0, -1);
const int ABC = 26;
string a[4];
int dp[N + 1][1 << 12];
int dp1[1 << 16];
vector<int> cost[4];
void init() {
  cost[0] = {65534, 65533, 65531, 65527};
  cost[1] = {65484, 65433, 65331};
  cost[2] = {63624, 61713};
  cost[3] = {0};
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(20);
  init();
  int n;
  cin >> n;
  int a1, a2, a3, a4;
  cin >> a1 >> a2 >> a3 >> a4;
  for (int i = 0; i < 4; i++) cin >> a[i];
  for (int i = 0; i < n + 1; i++)
    for (int mask = 0; mask < (1 << 12); mask++) dp[i][mask] = inf;
  dp[0][0] = 0;
  for (int i = 0; i < n; i++) {
    for (int nm = 0; nm < (1 << 16); nm++) dp1[nm] = inf;
    for (int mask = 0; mask < (1 << 12); mask++) {
      if (dp[i][mask] == inf) continue;
      int nm = mask;
      for (int j = 3; j > -1; j--) {
        nm <<= 1;
        if (a[j][i] == '*') nm++;
      }
      dp1[nm] = min(dp1[nm], dp[i][mask]);
    }
    for (int mask = (1 << 16) - 1; mask > -1; mask--) {
      if (i + 1 >= 1) {
        for (int j = 0; j < 4; j++)
          dp1[mask & cost[0][j]] = min(dp1[mask & cost[0][j]], dp1[mask] + a1);
      }
      if (i + 1 >= 2) {
        for (int j = 0; j < 3; j++)
          dp1[mask & cost[1][j]] = min(dp1[mask & cost[1][j]], dp1[mask] + a2);
      }
      if (i + 1 >= 3) {
        for (int j = 0; j < 2; j++)
          dp1[mask & cost[2][j]] = min(dp1[mask & cost[2][j]], dp1[mask] + a3);
      }
      if (i + 1 >= 4) {
        for (int j = 0; j < 1; j++)
          dp1[mask & cost[3][j]] = min(dp1[mask & cost[3][j]], dp1[mask] + a4);
      }
    }
    for (int mask = 0; mask < (1 << 12); mask++) dp[i + 1][mask] = dp1[mask];
  }
  cout << dp[n][0] << "\n";
  return 0;
}
