#include<cstdio>
#include<cmath>
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<ctype.h>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<list>
#define pi 4*atan(1)
#define eps 1e-10
#define INF 0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define FF(i,n) for(int i = 0 ; i < n ; i++)
#define F(i,n) for(int i = 1 ; i <= n ; i++)
#define maxn 100000+10
#define mod 200907
#define met(a) memset(a,0,sizeof(a))
typedef long long LL;
//typedef __int64 LL;
using namespace std;
int a[maxn],b[maxn];
int change(int x)
{
    return (1890*x+143)%10007;
}
int main()
{
    int n;
    while(cin>>n)
    {
        int res=0;
        FF(i,n)
        {
            scanf("%d",&a[i]);
            res+=a[i];
            //cout<<res<<endl;
            b[i]=change(a[i])-a[i];
            //cout<<"b[i]="<<b[i]<<endl;
        }
        int maxx=0;
        int sum=0;
        int l=0,r=0;
        while(1)
        {
            if(r>=n)break;
            while(sum>=0&&r<n)
            {
                sum+=b[r];
                maxx=max(maxx,sum);
                r++;
            }
            while(sum<0&&r<n)
            {
                sum-=b[l];
                maxx=max(maxx,sum);
                l++;
            }
        }
        res+=maxx;
        cout<<res<<endl;
    }
    return 0;
}