https://ac.nowcoder.com/acm/contest/322/A

题解：求和啊，快速幂啊

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=10000019;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
ll a[N];
char str;
int poww(int a, int b) {
    ll ans = 1, base = a;
    while (b != 0) {
        if (b & 1 != 0)
            ans = ans*base%MOD;
            base = base*base%MOD;
            b >>= 1;
    }
    return ans;
}
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d",&n);
    ll ans=0;
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i]);
        a[i]%=MOD;
        ans=(ans+poww(a[i],i))%MOD;
    }
    cout << ans << endl;
    //cout << "Hello world!" << endl;
    return 0;
}