#include<stdio.h>
#include<string.h>
#include<vector>
#include<string>
#include<sstream>
#include<queue>
#include<cctype>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define calm (l+r)>>1
const int mod=1e9+7;
inline int f(int x){return (1890*x+143)%10007;}
int n;
int a[2][100010];
int main(){
//    freopen("D://input.txt","r",stdin);
    while(scanf("%d",&n)!=EOF){
        int i;
        long long sum=0;
        for(i=0;i<n;i++){
            scanf("%d",&a[0][i]);
            sum+=a[0][i];
        }
        for(i=0;i<n;i++)a[1][i]=f(a[0][i])-a[0][i];
        long long tot=0,maxn=0;
        for(i=0;i<n;i++){
            if(tot+a[1][i]<a[1][i]){
                tot=a[1][i];
            }
            else{
                tot+=a[1][i];
            }
            maxn=max(maxn,tot);
        }
        printf("%I64d\n",sum+maxn);
    }
    return 0;
}