#include<fstream>
#include<queue>
using namespace std;
int s[100001];
int min(int a,int b)
{
	if(a>b)
		return b;
	else
		return a;
}
int main(void)
{
	ifstream fin("circlea.in");
	ofstream fout("circlea.out");
	int n,num=0;
	int max=-1;
	fin>>n;
	int i,j;
	int sum=0;
	for(i=1;i<=n;i++)
	{
		fin>>s[i];
		sum+=s[i];
	}
	j=1;
	for(i=1;i<=n;i++)
	{
		num+=s[i];
		for(;num>sum/2;j++)
		{
			if(min(num,sum-num)>max)
				max=min(num,sum-num);
			num-=s[j];
		}
		if(min(num,sum-num)>max)
				max=min(num,sum-num);
	}
	fout<<max;
	fin.close();
	fout.close();
	return 0;
}