#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;

vector<int> a;
vector<int> indexx;

bool f(int c, int b)
{
//    cout << "comparing " << c << " and " << b << endl;
    return a.at(c)<a.at(b);
}


int main(void)
{
    int min=0;
    int n;
    cin >> n;
    while(n!=0)
    {
        a.clear();
        indexx.clear();
        for(int i=0;i<n;i++)
          indexx.push_back(i);
        
        
        
        int k=n/2;
        for(int i=0;i<n;i++)
        {
            int temp;
            cin >> temp;
            a.push_back(temp);
        }
        
        sort(indexx.begin(),indexx.end(),f);
        
        int tempsum=0,sum=0;
        
        int tmax=a.at(0);
        int tmaxpos=0;
        for(int i=0;i<k-1;i++)
        {   
            tempsum+=a.at(i);
            if(a.at(i)>tmax)
            {
                tmax=a.at(i);
                tmaxpos=i;
            }
        }
        
        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++)
            {   
                if(a.at((i+j)%n)>tmax)
                {
                    tmax=a.at((i+j)%n);
                    tmaxpos=(i+j)%n;
                }
                
            }*/
            if(tmax<=a.at((i+k-2)%n))
            {
                tmax=a.at((i+k-2)%n);
                tmaxpos=(i+k-2)%n;
            }
            else if (tmaxpos == i-1) 
            {
                int ti=n-1;
                while(((indexx.at(ti)<i)?(indexx.at(ti)+n):(indexx.at(ti)))<k-1)
                {
//                    cout << "ti: " << ti << endl;
                    ti--;           
                }
                tmaxpos=ti;
                tmax=a.at(ti);
            }
            min=mint(mint(min,tempsum),tempsum-tmax+a.at((i+k-1)%n));
        }
        
        cout << sum+min << endl;
        cin >> n;
    }   
    
        
    
    
    
    return 0;
}