#include <cstdlib>
#include <fstream>
#include <cassert>
#include <iostream>
using namespace std;


int n;
int Stomp [2][3];
int Matrix [2][1000000];

int main () {

int result=0;

ifstream input("input.txt"); assert(input);
//leggi valori attuali N e M
ofstream output("output.txt"); assert(output);
input >> n;
input >> Stomp [0][0];
input >> Stomp [0][1];
input >> Stomp [0][2];
input >> Stomp [1][0];
input >> Stomp [1][1];
input >> Stomp [1][2];
signed int i = 0;
while (i<n) {
    input >> Matrix[0][i];
    i++;
}
i=0;
while (i<n) {
    input >> Matrix[0][i];
    i++;
}
i=0;

if ((Stomp [0][0]+Stomp [0][1]+Stomp [0][2]+Stomp [1][0]+Stomp [0][1]+Stomp [0][2]) == 0) {output << 0;}

else {

i=0;
signed int attuale=0;
int prova=0;
    while ((i<=(n-3))&&(prova<38000000)) {
        if (Stomp [0][0]==1 && Matrix[0][i]==1) attuale++;
        if (Stomp [0][0]==1 && Matrix[0][i]==0) attuale--;
        if (Stomp [0][1]==1 && Matrix[0][i+1]==1) attuale++;
        if (Stomp [0][1]==1 && Matrix[0][i+1]==0) attuale--;
        if (Stomp [0][2]==1 && Matrix[0][i+2]==1) attuale++;
        if (Stomp [0][2]==1 && Matrix[0][i+2]==0) attuale--;

        if (Stomp [1][0]==1 && Matrix[1][i]==1) attuale++;
        if (Stomp [1][0]==1 && Matrix[1][i]==0) attuale--;
        if (Stomp [1][1]==1 && Matrix[1][i+1]==1) attuale++;
        if (Stomp [1][1]==1 && Matrix[1][i+1]==0) attuale--;
        if (Stomp [1][2]==1 && Matrix[1][i+2]==1) attuale++;
        if (Stomp [1][2]==1 && Matrix[1][i+2]==0) attuale--;
        if (attuale>0) {

            if (Stomp [0][0]==1 && Matrix[0][i]==1) Matrix[0][i]=0;
            if (Stomp [0][0]==1 && Matrix[0][i]==0) Matrix[0][i]=1;
            if (Stomp [0][1]==1 && Matrix[0][i+1]==1) Matrix[0][i+1]=0;
            if (Stomp [0][1]==1 && Matrix[0][i+1]==0) Matrix[0][i+1]=1;
            if (Stomp [0][2]==1 && Matrix[0][i+2]==1) Matrix[0][i+2]=0;
            if (Stomp [0][2]==1 && Matrix[0][i+2]==0) Matrix[0][i+2]=1;
            i=0;
        }
        else {
            i++;
            attuale=0;
            prova++;
        }
    }
    i=0;
    
    while (i<n){result=result+Matrix[0][i];i++;} i=0;
    while (i<n){result=result+Matrix[1][i];i++;} i=0;
    output << result; 
}

}