#include <bits/stdc++.h>
#include <math.h> 
using namespace std;

int slove(vector <int> s) {
     int hexan ;
     for(int t = 0; t < s.size() -1 ; t++){
          hexan += s[t] ;
         
         
     }
    
return hexan%10000 ; }

vector <int> solve(vector <int> a) {
       vector<int> sub(4000) ;

    int sum ;
    //  Return the length of the longest possible sequence of moves modulo 10^9+7.
     for(int t = 0; t <= a.size() -1 ; t++){
         int wes ;  
            for(int f = 0; f <= a.size() - t -1 ; f++){
                   
              //  int ind = pow (2 ,a.length) ;
                    int index = f+t ;
                    sub[wes] = a[index] ;
                    wes++ ;
                       
                 }
         
                 }
    return sub ;
}

int main() {
    int n;
    cin >> n;
    vector<int> m(n);
    for(int i = 0; i < n; i++){
       cin >> m[i];
    }
    
     vector<int> hex = solve(m) ;
    vector<int> hexa = solve(hex);
    int result = slove(hexa);
    
    cout << result << endl;
    return 0;
}