//Lasha Bukhnikashvili
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<string>
#define Pi 3.14159265358
#define mod9 %1000000009
#define INF 1000000000
#define mod7 %1000000009
#define LL  long long
#define time clock()/(double)CLOCKS_PER_SEC
using namespace std;
 vector<int> a,b,c,A,B,C;
 int sumA[1000001],sumB[1000001],sumC[1000001],maxi[1000001];
 int ans,x,out,l,n,i;
 void solve(){
       for (i=1;i<=n;i++)
             sumA[i]=sumA[i-1]+A[i-1];
       for (i=1;i<=n;i++)
             sumB[i]=sumB[i-1]+B[i-1];
       for (i=1;i<=n;i++)
             sumC[i]=sumC[i-1]+C[i-1];

       maxi[n-1]=sumB[n-1]-sumC[n-1];
       for (i=n-2;i>=1;i--){
           maxi[i]=min(maxi[i+1],sumB[i]-sumC[i]);
       }
       for (l=1;l<n-1;l++){
             out=sumA[l]-sumB[l]+sumC[n];
             out+=maxi[l+1];
             ans=min(ans,out);
       }
 }
int main(){

    ans=INF;
    cin>>n;
    for (i=1;i<=n;i++)
            cin>>x,a.push_back(x);
       for (i=1;i<=n;i++)
            cin>>x,b.push_back(x);
       for (i=1;i<=n;i++)
            cin>>x,c.push_back(x);

       A=a;
       B=b;
       C=c;
       solve();

       A=a;
       B=c;
       C=b;
       solve();

       A=b;
       B=a;
       C=c;
       solve();

       A=b;
       B=c;
       C=a;
       solve();

       A=c;
       B=a;
       C=b;
       solve();

       A=c;
       B=b;
       C=a;
       solve();


       cout<<ans;
 return 0;
}