#include <iostream>
#include <stdio.h>
#include <set>
using namespace std;
const int maxn = 100010;
int a[maxn];
int sum[maxn] = {0};
int sum_old[maxn] = {0};
int f(int x) {
    return (1890 * x + 143) % 10007;
}
int main()
{
    
    int n;
    while(~scanf("%d", &n)) {
        int s = 0;
        for(int i=1;i<=n;i++) {
            scanf("%d", &a[i]);
            s += a[i];
        }
        set<int> st;
        int cur = 0;
        int ans = 0;
        st.insert(0);
        for(int i=1;i<=n;i++) {
            sum[i] = sum[i-1] + f(a[i]);
            sum_old[i] = sum_old[i-1] + a[i];
            st.insert(sum[i] - sum_old[i]);
            ans = max(ans, s - sum_old[i] + sum[i] - *st.begin());
        }
        cout << ans << endl;
    }


    return 0;
}