#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <set>
#include <list>
#include <queue>
#include <map>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-4
#define maxn 100010
#define N 100000
long long a[maxn],b[maxn],c[maxn];
int main()
{
    int t,n;
    //scanf("%d",&t);
    while(scanf("%d",&n) != EOF)
    {
        long long sum = 0;
        for(int i = 0; i < n; i++)
        {
            scanf("%I64d",&a[i]);
            sum += a[i];
            b[i] = (1890*a[i]+143)%10007;
            c[i] = b[i] - a[i];
        }
        long long Max = 0,ssum = 0;

        for(int i = 0; i < n; i++)
        {
            if(c[i] + ssum < 0)
                ssum = 0;
            else
                ssum += c[i];
            Max = max(ssum,Max);
        }
        Max = max(ssum,Max);
        printf("%I64d\n",sum + Max);
    }
    return 0;
}