#include<iostream>
#include<string.h>
#include<math.h>
using namespace std;

int biao[10005];
int num[100005];
int cot[100005];

int max(int a, int b) {
    return a > b ? a : b;
}

int main() {
    int n;
    while (scanf("%d", &n) != EOF) {
        int sum = 0;
        int t;
        for (int i = 1; i <= n; i++) {
            
            scanf("%d", &t);
            sum += t;
            num[i] = (1890 * t + 143) % 10007 - t;
        }
        int last = 0;
        int ans = num[1];
        for (int i = 1; i <= n; i++)
        {    
            last = max(0, last) + num[i];
            ans = max(ans, last);
        }
        if (ans < 0) {
            cout << sum << endl;
        }
        else
            cout << sum + ans << endl;
    }
    return 0;
}