#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

typedef long long LL;

const int maxn=100010;

int a[maxn],v[maxn],f[maxn];

int main(){
        int n;
        while(scanf("%d",&n)!=EOF){
                int ans=0;
                for(int i=1; i<=n; ++i){
                       scanf("%d",&a[i]);
                       ans+=a[i];
                       v[i]=(a[i]*1890+143)%10007-a[i];
                }
                int cnt=0;
                f[0]=0;
                for(int i=1; i<=n; ++i){
                        f[i]=max(v[i],f[i-1]+v[i]);
                        cnt=max(f[i],cnt);
                }
                ans+=cnt;
                printf("%d\n",ans);
        }
        return 0;
}