#include <stdio.h>
int pol[2000];
int subs[2000][1000];
inline unsigned int min(unsigned int a, unsigned int b){return (a<b)*a + (a>=b)*b;}
int main(){
	int n;
	while(scanf("%d",&n)>0){
		if(!n)return n;
		unsigned int i,K,j,ll,k,l,S = 0; unsigned int cM = -1;
		for(i=0;i<n;i++){
			scanf("%d",&pol[i]);
			subs[i][1]=pol[i];
			subs[i][0]=0;	//er?
			S+=pol[i];
		}
		K = n/2 - 1;	//pocet spolecnych poli
		for(j=2;j<=K;j++){
			for(i=0;i<n;i++){
				subs[i][j] = subs[i][j-1] + pol[(i+j-1)%n];
			}
		}
		
		for(i=0;i<n;i++){ // zacatky pruniku 0 a 1 na i

			for(k = 0; k < K; k++){ //velikost pruniku 0 a 1

				//prunik 2 je celkem K - k
				for(j = 0; j<(K - k); j++){ //velikost lev pr

ll =		subs[i][k] + subs[(i + k + j + 1)%n][K -k -j] + subs[(i + k + j + 1 + K + 1 - j)%n][j];
cM = min(cM,ll); 
//printf("e p1 at %d vel %d, p2 vel %d at %d + %d at %d, %d\n",i,k,K-k-j,(i + k + j + 1)%n,j,(i+k+j+1+K+1-j)%n,ll);

				}
			}
		}
		printf("%u\n",S+cM);
	}
	return 0;
}