#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define M 1000009
int a[M],b[M];
int f(int x)
{
    return (1890*x+143)%10007;
}
int main()
{
    int n;
    while(scanf("%d",&n) == 1)
    {
        int sum = 0;
        for(int i = 0;i < n;i++)
        {
            scanf("%d",&a[i]);
            int tmp = f(a[i]);
            b[i] = tmp - a[i];
        }
        int st = -1,end = -1;
        int maxx = 0;
        int cur = -1;
        int ans = 0;
        int tmp = 0;
        for(int i = 0;i < n;i++)
        {
            tmp += b[i];
            if(tmp < 0)
            {
                tmp = 0;
                cur = i;
            }
            if(tmp > ans)
            {
                ans = tmp;
                st = cur+1;
                end = i;
            }
        }
        if(st != -1 && end != -1)
        for(int i = st;i <= end;i++) b[i] += a[i];
        //printf("---debug---st = %d end = %d\n",st,end);
        for(int i = 0;i < n;i++)
        {
            if(st <= i && i <= end) sum += b[i];
            else sum += a[i];
        }
        printf("%d\n",sum);
    }
    return 0;
}