#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <cstdlib>
#include <utility>
#include <cmath>
using namespace std;
#define ll long long
#define all(x) (x).begin(), (x).end() 
#define ayacin ios::sync_with_stdio(false);
#define mod 1000000007
#define yukari 999999999
#define M_PI12 3.141592653
#define Parseedouble long double
#define N 40005 
#define lson o<<1
#define rson o<<1|1
int a[1000005],num[1000005];
int dp[1000005];
int main(){
    int m,n,i,j,k;
    ayacin;
    while(cin>>m){
        memset(dp,0,sizeof(dp));
        for(i=1;i<=m;i++) cin>>a[i];
        for(i=1;i<=m;i++){
            num[i]=(1890*a[i]+143)%10007-a[i];
        }
        ll ans=0;
        for(i=1;i<=m;i++) ans+=(ll)(a[i]);
        for(i=1;i<=m;i++){
            dp[i]=max(dp[i-1]+num[i],num[i]);
        }
        int maxn=0;
        for(i=1;i<=m;i++){
            maxn=max(maxn,dp[i]);
        }
        cout<<(ans+maxn)<<endl;
    }
}