#include<bits/stdc++.h>
#define fori(i,a,b) for(int i = a;i <= b; i++)
#define int long long
#define pb push_back
using namespace std;
typedef pair<int,int> ii;
typedef tuple<int,int,int> tp;
const int M = 1e6 + 10;
const int N = 5e3 + 10;
const int mod = 1e6 + 3;
int n,h[N];
int target[N];
vector<int> Q[N];
vector<int> rrh;
int calc(int l,int r) {
return ((l + r) * (r - l + 1) / 2) % mod;
}
int add(int a,int b) {
return (a + b) % mod;
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen("1.inp","r"))
{
freopen("1.inp","r",stdin);
freopen("1.out","w",stdout);
}
#define task ""
if(fopen(task".inp","r"))
{
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
cin >> n;
for(int i = 1;i <= n; i++) cin >> h[i];
int suf = 0,pre = 0;
for(int i = 1;i <= n; i++) {
pre = max(pre, h[i]);
target[i] = pre ;
}
for(int i = n; i != 0; i--) {
suf = max(suf, h[i]);
target[i] = min(target[i], suf);
}
for(int i = 1;i <= n; i++) rrh.pb(h[i]);
sort(rrh.begin(),rrh.end());
rrh.resize(unique (rrh.begin(), rrh.end()) - rrh.begin());
for(int i = 1;i <= n; i++) {
h[i] = lower_bound(rrh.begin(),rrh.end(),h[i]) - rrh.begin() ;
target[i] = lower_bound(rrh.begin(),rrh.end(),target[i]) - rrh.begin() ;
//cout << h[i] << " " << target[i] << "\n";
}
for(int i = 1;i <= n; i++) {
if(h[i] != target[i]) {
Q[h[i]].pb(i);
}
}
int kq = 0;
int m = rrh.size();
for(int high = 0;high <= m - 2; high++) {
int sz = Q[high].size();
if(sz == 0) continue;
int val = rrh[high] % mod;
int nxt_val = rrh[high + 1] % mod;
if(sz == 1) {
int x = 1e9 , y = 1e9 , cur = Q[high][0];
for(int j = 1; j < cur; j++) {
if(h[j] > h[cur]) x = min(x,rrh[h[j]]);
}
for(int j = cur + 1; j <= n ;j++) {
if(h[j] > h[cur]) y = min(y,rrh[h[j]]);
}
x %= mod;
y %= mod;
kq = (kq + (nxt_val - val)*(x + y) % mod ) % mod;
h[cur]++;
if(h[cur] != target[cur]) Q[h[cur]].pb(cur);
}
else {
sort(Q[high].begin(),Q[high].end());
int pre_l = 1e9 , pre_r = 1e9 , suf_l = 1e9 , suf_r = 1e9;
int l = Q[high][0], r = Q[high].back();
for(int j = 1;j < l ; j++) {
if(h[j] > h[l]) pre_l = min(pre_l,rrh[h[j]]);
}
for(int j = l + 1;j <= n; j++) {
if(h[j] > h[l]) suf_l = min(suf_l,rrh[h[j]]);
}
for(int j = 1; j < r; j++) {
if(h[j] > h[r]) pre_r = min(pre_r,rrh[h[j]]);
}
for(int j = r + 1;j <= n; j++) {
if(h[j] > h[r]) suf_r = min(suf_r,rrh[h[j]]);
}
// cout << Q[high].size() << " " << pre_l << " " << suf_l << " " << pre_r << " " << suf_r << "\n";
// cout << val << " " << nxt_val << " ";
// cout << calc(val,nxt_val - 1) << " ";
// cout << calc(val + 1,nxt_val) << "\n";
int x =(rrh[high + 1] - rrh[high]) * add(pre_l,suf_l) + (rrh[high + 1] - rrh[high]) * suf_r ;
int y =(rrh[high + 1] - rrh[high]) * add(pre_r,suf_r) + (rrh[high + 1] - rrh[high]) * pre_l ;
//cout << x << " " << y << "a\n";
x = min(x,y) % mod;
kq = (kq + x) % mod;
//cout << kq << "a\n";
kq = ( kq + (sz - 2) * 2ll * calc(val + 1 ,nxt_val) % mod + calc(val + 1,nxt_val)) % mod;
for(int idx : Q[high]) {
h[idx]++;
if(h[idx] != target[idx]) Q[h[idx]].pb(idx);
}
}
kq = (kq + sz * calc(val,nxt_val - 1) % mod) % mod;
//cout << val << " " << nxt_val << " " << sz * calc(val,nxt_val - 1) << " " << kq << '\n';
}
cout << kq % mod;
}
