#include <iostream>
#include <algorithm>
using namespace std;
const int N=150001;
const int INF=0x3f3f3f3f;
int a[N],b[N],c[N],f[N],g[N],*p[3]={a,b,c};
int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int n,ans=INF;
    cin>>n;
    for(int i=1;i<=n;++i) cin>>a[i],a[i]+=a[i-1];
    for(int i=1;i<=n;++i) cin>>b[i],b[i]+=b[i-1];
    for(int i=1;i<=n;++i) cin>>c[i],c[i]+=c[i-1];
    f[0]=f[1]=g[0]=g[1]=g[2]=INF;
    do{
        //cout<<p[0]<<' '<<p[1]<<' '<<p[2]<<'\n';
        for(int i=2;i<=n;++i){
            f[i]=min(f[i-1],p[0][i-1])+p[1][i]-p[1][i-1];
            //cout<<f[i]<<' ';
        }
        //cout<<endl;
        for(int i=3;i<=n;++i){
            g[i]=min(g[i-1],f[i-1])+p[2][i]-p[2][i-1];
            //cout<<g[i]<<' ';
        }
        //cout<<endl;
        ans=min(ans,g[n]);
    }while(next_permutation(p,p+3));
    cout<<ans;
	return 0;
}

rt，过了样例，测试全wa掉了，qwq。