#include <bits/stdc++.h>
using namespace std;
int n, dp[5][1010][(1 << 12)], p[4];
bool bio[5][1010][(1 << 12)];
string s[5];
int rek(int x, int y, int mask) {
  if (y >= n) return 0;
  if (bio[x][y][mask]) return dp[x][y][mask];
  bio[x][y][mask] = 1;
  int ret = 1e9;
  for (int i = 1; i <= 3; i++) {
    if (x - i >= -1) {
      int newmask = 0;
      for (int j = 0; j < 3; j++) {
        for (int k = 0; k <= 3; k++) {
          if (k >= i || j >= i) {
            newmask += (mask & (1 << (j * 4 + k)));
          }
        }
      }
      newmask /= 2;
      if (s[x][y + 3] == '*') newmask += (1 << 11);
      int newx, newy;
      if (x == 0) {
        newx = 3;
      } else
        newx = x - 1;
      if (newx == 3)
        newy = y + 1;
      else
        newy = y;
      ret = min(ret, rek(newx, newy, newmask) + p[i]);
    }
  }
  if (x == 3) {
    int newmask = 0;
    for (int i = y + 4; i < y + 7; i++) {
      for (int j = 3; j >= 0; j--) {
        if (s[j][i] == '*') newmask += (1 << ((i - y - 4) * 4 + 3 - j));
      }
    }
    ret = min(ret, rek(x, y + 4, newmask) + p[4]);
  }
  if ((mask & 1) == 0) {
    int newmask = mask / 2;
    if (s[x][y + 3] == '*') newmask += (1 << 11);
    if (x > 0) {
      ret = min(ret, rek(x - 1, y, newmask));
    } else {
      ret = min(ret, rek(3, y + 1, newmask));
    }
  }
  return dp[x][y][mask] = ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= 4; i++) cin >> p[i];
  for (int i = 0; i < 4; i++) {
    cin >> s[i];
    s[i] += '.';
    s[i] += '.';
    s[i] += '.';
    s[i] += '.';
    s[i] += '.';
    s[i] += '.';
  }
  int maska = 0;
  for (int i = 0; i <= 2; i++) {
    for (int j = 3; j >= 0; j--) {
      if (s[j][i] == '*') maska += (1 << (i * 4 + 3 - j));
    }
  }
  cout << rek(3, 0, maska);
}
