/*#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/
#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pair<ll, ll>>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
//using namespace __gnu_pbds;
const ll INF = 1e18+7;
const int lg = 20;
//const ll MOD = 1e9+7;
//const ll MOD2 = 998244353;
const ll MOD3 = 1e6+3;
mt19937 rng(1488);
ll randll(ll l, ll r) {
return uniform_int_distribution<ll>(l, r)(rng);
}
vll tree;
void bt(ll v, ll tl, ll tr, vll& a) {
if (tl == tr) {
tree[v] = a[tl];
return;
}
ll tm = (tl+tr)/2;
bt(v*2, tl, tm, a);
bt(v*2+1, tm+1, tr, a);
tree[v] = min(tree[v*2], tree[v*2+1]);
}
ll get(ll l, ll r, ll v, ll tl, ll tr) {
if (l <= tl && tr <= r) return tree[v];
if (tl > r || tr < l) return INF;
ll tm = (tl+tr)/2;
//push(v, tl, tr);
ll p = get(l, r, v*2, tl, tm), p1 = get(l, r, v*2+1, tm+1, tr);
return min(p,p1);
}
void update(ll idx, ll val, ll v, ll tl, ll tr) {
if (tl == tr) {
tree[v] = val;
return;
}
ll tm = (tl+tr)/2;
//push(v, tl, tr);
if (idx <= tm)update(idx, val, v*2, tl, tm);
else update(idx, val, v*2+1, tm+1, tr);
tree[v] = min(tree[v*2], tree[v*2+1]);
}
int main() {
speed;
ll n;
cin >> n;
vll a(n);
map<ll, vll> m, m1;
set<ll> s1;
for (int i = 0; i < n; i ++) {
cin >> a[i];
s1.insert(a[i]);
m[a[i]].pb(i);
}
tree.resize(n*4+7);
bt(1, 0, n-1, a);
vll b = a;
ll mx = 0;
for (int i = 0; i < n; i ++) {
mx = max(mx, a[i]);
b[i] = mx;
s1.insert(b[i]);
}
mx = 0;
for (int i = n-1; i >= 0; i --) {
mx = max(mx, a[i]);
b[i] = min(b[i], mx);
m1[b[i]].pb(i);
}
/*for (int i = 0; i < n; i ++) {
cout << b[i] << " ";
}
cout << endl;*/
set<ll> s;
ll k = 0, res = 0;
ll last = 0;
for (ll i : s1) {
if (!s.empty()) {
ll l = *s.begin(), r = *--s.end();
ll c = 0;
c += (get(0, l-1, 1, 0, n-1)+get(r+1, n-1, 1, 0, n-1))*(i-last);
c %= MOD3;
if (l != r) {
c += min(get(l+1, n-1, 1, 0, n-1), get(0, r-1, 1, 0, n-1))*(i-last)+(((i+1)*i/2%MOD3 - (last+1)*last/2%MOD3+MOD3)%MOD3);
c %= MOD3;
c += (ll)(s.size()-2)*(((i+1)*i/2%MOD3 - (last+1)*last/2%MOD3+MOD3)%MOD3)*2;
c %= MOD3;
}
c += (ll)s.size()*(((i-1)*i/2%MOD3 - (last-1)*last/2%MOD3+MOD3)%MOD3);
c %= MOD3;
res += c;
res %= MOD3;
//cout << i << ' ' << c << endl;
}
for (int j : m[i]) {
update(j, INF, 1, 0, n-1);
s.insert(j);
}
for (int j : m1[i]) {
s.erase(j);
}
last = i;
}
cout << res << endl;
}
