#include <iostream>
#include <sstream>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <algorithm>
#include <list>
#include <stack>
#include <numeric>

#define max(x,y) ((x) > (y) ? (x) : (y))
#define mint(x,y) ((x) < (y) ? (x) : (y))

using namespace std;




int main(void)
{
    int min=0;
    int n;
    cin >> n;
    while(n!=0)
    {
        vector<int> a;
        int k=n/2;
        for(int i=0;i<n;i++)
        {
            int temp;
            cin >> temp;
            a.push_back(temp);
        }
        
        int tempsum=0,sum=0;
        
        int tmax=a.at(0);
        for(int i=0;i<k-1;i++)
        {   
            tempsum+=a.at(i);
            tmax=max(a.at(i),tmax);
        }
        
        for(int i=0;i<n;i++)
            sum+=a.at(i);
        
        
        
        min=mint(tempsum,tempsum-tmax+a.at(k-1));
        
        
        for(int i=1;i<n;i++)
        {
            tempsum+=(a.at((i+k-2)%n)-a.at(i-1));
    //        cout << "here: " <<  i << " " <<a.at(i) << " " << tempsum << endl;
            tmax=a.at(i);
            for(int j=0;j<k-1;j++)
            {   
                tmax=max(a.at((i+j)%n),tmax);
            }
            min=mint(mint(min,tempsum),tempsum-tmax+a.at((i+k-1)%n));
        }
        
        cout << sum+min << endl;
        cin >> n;
    }   
    
        
    
    
    
    return 0;
}