#include<iostream>
#include<cstdio>
#include<algorithm>>
#include<cstring>
#include<cmath>
using namespace std;
#define LL long long
const int maxn = 100050;
LL a[maxn],b[maxn],sumb[maxn],suma;
///LL inf = 1e18;
int main()
{
    int n;
    ///freopen("in.txt","r",stdin);
    while(scanf("%d",&n)!=EOF){
        suma = 0;
        for(int i = 0;i<n;i++){
            scanf("%I64d",&a[i]);
            suma+=a[i];
            b[i] = (1890*a[i]+143)%10007 - a[i];
            if(!i)sumb[i] = b[i];
            else sumb[i] = b[i] + sumb[i-1];
        }
        LL minv = min(sumb[0],0LL),up = max(0LL,sumb[0]);
        for(int i = 1;i<n;i++){
            up = max(up,sumb[i]-minv);
            minv = min(sumb[i],minv);
        }
        printf("%I64d\n",up+suma);
    }
    return 0;
}