#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f

int a[100010], f[100010], n, ans;

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