#include <iostream>
#include <string>
#include <iomanip>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define LL long long

using namespace std;
const int maxn=1e5+10;
struct node
{
    int x;
    int Fx;
} ls[maxn];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int sum=0;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&ls[i].x);
            sum += ls[i].x;
            ls[i].Fx = (1890*ls[i].x+143)%10007 - ls[i].x;
        }
        int tt=0,now=0;
        for(int i=0;i<n;i++)
        {
            tt+=ls[i].Fx;
            tt = tt < 0 ? 0 : tt;
            now = max(now,tt);
        }
        printf("%d\n",now+sum);
    }
    return 0;
}