#include <bits/stdc++.h>   const int dx[] = {1, 0, -1, 0};   const int dy[] = {0, 1, 0, -1};   using namespace std;   const int MAXN = 55;   int n;   int a[2][MAXN];   int asum[2][MAXN];   int b[MAXN];   int main() {     cin.tie(0);     ios::sync_with_stdio(false);     cin >> n;     for (int j = 0; j < 2; j++)       for (int i = 0; i < n - 1; i++) cin >> a[j][i];     for (int i = 0; i < n; i++) cin >> b[i];     for (int i = 1; i < n; i++) asum[0][i] = asum[0][i - 1] + a[0][i - 1];     for (int i = n - 2; i >= 0; i--) asum[1][i] = asum[1][i + 1] + a[1][i];     vector<int> length;     for (int i = 0; i < n; i++) length.push_back(asum[0][i] + asum[1][i] + b[i]);     sort(length.begin(), length.end());     cout << length[0] + length[1] << endl;     return 0;   }   