#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#define MAX 100000
#define LL long long
using namespace std;
LL fun(LL x)
{
	return ((1890*x)%10007+143%10007)%10007;
}
int main()
{
	int n,m,j,i,k;
	int s[MAX],a[MAX],b[MAX];
	while(scanf("%d",&n)!=EOF)
	{
		int sun=0;
	    for(i=1;i<=n;i++)
	    {
	    	scanf("%d",&s[i]);
	    	a[i]=fun(s[i]);//储存 f(x); 
	    	b[i]=a[i]-s[i];//储存f(x)和x的差值 
	    	sun+=s[i];
	    }	
	    int sum=0;
	    int Max=0;
	    for(i=1;i<=n;i++)//最大子段和代码 
	    {
	    	if(sum<=0)
	    	sum=b[i];
	    	else
	    	sum+=b[i];
	    	Max=max(Max,sum);//求出最大子段 
	    }
	    printf("%d\n",sun+Max);
	}
	return 0; 
}