#include <iostream>

#include <algorithm>

#include <cstdio>

#include <vector>

#define PER(i,a,n) for(int i=n;i>=a;--i)

#define REP(i,a,n) for(int i=a;i<=n;++i)

#define pb push_back

using namespace std;

const int N = 1e3+10, M = (1<<12)-1, INF = 0x3f3f3f3f;

int n, c[4];

char s[4][N];

int sta[N], dp[N][M+10];

vector<int> mat[3];

void chkmin(int &x,int y) {x=min(x,y);}

int main() {

	scanf("%d", &n);

	REP(i,0,3) scanf("%d", c+i);

	REP(i,0,3) scanf("%s", s[i]);

	REP(i,0,2) REP(j,0,3) {

		int t = M;

		REP(k,j,min(3,i+j)) {

			REP(kk,0,i) t ^= 1<<(k+4*kk);

		}

		mat[i].pb(t);

	}

	REP(i,0,3) REP(j,0,n-1) (sta[j]<<=1)|=(s[i][j]=='*');

	memset(dp, 0x3f, sizeof dp);

	dp[0][sta[0]^(sta[1]<<4)^(sta[2]<<8)] = 0;

	REP(i,0,n-1) PER(j,0,M) if (dp[i][j]!=INF) {

		if (!(j&15)) chkmin(dp[i+1][(j>>4)^(sta[i+3]<<8)],dp[i][j]);

		chkmin(dp[i+1][0], dp[i][j]+c[3]);

		REP(k,0,2) for (int kk:mat[k]) {

			chkmin(dp[i][j&kk], dp[i][j]+c[k]);

		}

	}

	printf("%d\n", dp[n-1][0]);

}