/*************************************
* author: marvinthang *
* created: 21.07.2023 09:05:59 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
const int MOD = 1e6 + 3;
namespace Mod {
inline void fasterLLDivMod(unsigned long long x, unsigned y, unsigned &out_d, unsigned &out_m) {
unsigned xh = (unsigned)(x >> 32), xl = (unsigned)x, d, m;
#ifdef __GNUC__
asm(
"divl %4 \n\t"
: "=a" (d), "=d" (m)
: "d" (xh), "a" (xl), "r" (y)
);
#else
__asm {
mov edx, dword ptr[xh];
mov eax, dword ptr[xl];
div dword ptr[y];
mov dword ptr[d], eax;
mov dword ptr[m], edx;
};
#endif
out_d = d; out_m = m;
}
template <class T> T invGeneral(T a, T b) {
a %= b;
if (!a) return b == 1 ? 0 : -1;
T x = invGeneral(b, a);
return x == -1 ? -1 : ((1 - 1LL * b * x) / a + b) % b;
}
template <int MOD>
struct ModInt {
unsigned int val;
ModInt(void): val(0) {}
ModInt(const long long &x) { *this = x; }
ModInt & normalize(const unsigned int &v) {
val = v >= MOD ? v - MOD : v;
return *this;
}
bool operator ! (void) { return !val; }
ModInt & operator = (const ModInt &x) { val = x.val; return *this; }
ModInt & operator = (const long long &x) { return normalize(x % MOD + MOD); }
ModInt operator - (void) { return ModInt(MOD - val); }
ModInt & operator += (const ModInt &other) { return normalize(val + other.val); }
ModInt & operator -= (const ModInt &other) { return normalize(val + MOD - other.val); }
ModInt & operator /= (const ModInt &other) { return *this *= other.inv(); }
ModInt & operator *= (const ModInt &other) {
unsigned dummy;
fasterLLDivMod((unsigned long long) val * other.val, MOD, dummy, val);
return *this;
}
ModInt operator + (const ModInt &other) const { return ModInt(*this) += other; }
ModInt operator - (const ModInt &other) const { return ModInt(*this) -= other; }
ModInt operator * (const ModInt &other) const { return ModInt(*this) *= other; }
ModInt operator / (const ModInt &other) const { return ModInt(*this) /= other; }
ModInt pow(long long n) const {
assert(n >= 0);
ModInt res = 1, a = *this;
for (; n; n >>= 1, a *= a) if (n & 1) res *= a;
return res;
}
ModInt inv(void) const {
int i = invGeneral((int) val, MOD);
assert(~i);
return i;
}
ModInt & operator ++ (void) { return *this += 1; }
ModInt & operator -- (void) { return *this -= 1; }
ModInt operator ++ (int) { ModInt old = *this; operator ++(); return old; }
ModInt operator -- (int) { ModInt old = *this; operator --(); return old; }
friend ModInt operator + (const long long &x, const ModInt &y) { return ModInt(x) + y; }
friend ModInt operator - (const long long &x, const ModInt &y) { return ModInt(x) - y; }
friend ModInt operator * (const long long &x, const ModInt &y) { return ModInt(x) * y; }
friend ModInt operator / (const long long &x, const ModInt &y) { return ModInt(x) / y; }
friend ostream & operator << (ostream &out, const ModInt &x) { return out << x.val; }
friend istream & operator >> (istream &in, ModInt &x) { long long a; in >> a; x = a; return in; }
bool operator < (const ModInt &other) const { return val < other.val; }
bool operator > (const ModInt &other) const { return val > other.val; }
bool operator <= (const ModInt &other) const { return val <= other.val; }
bool operator >= (const ModInt &other) const { return val >= other.val; }
bool operator == (const ModInt &other) const { return val == other.val; }
bool operator != (const ModInt &other) const { return val != other.val; }
explicit operator bool(void) const { return val; }
explicit operator int(void) const { return val; }
};
using Modular = ModInt <MOD>;
}
using namespace Mod;
// end of template
const int MAX = 1e6 + 6;
const int INF = 1e9 + 7;
int N, H[MAX];
void init(void) {
cin >> N;
FORE(i, 1, N) cin >> H[i];
}
vector <int> List[MAX];
int st[MAX << 2];
void build(int i, int l, int r) {
if (l == r) {
st[i] = H[l];
return;
}
int m = l + r >> 1;
build(i << 1, l, m);
build(i << 1 | 1, m + 1, r);
st[i] = min(st[i << 1], st[i << 1 | 1]);
}
void update(int i, int l, int r, int p, int v) {
if (l == r) {
st[i] = v;
return;
}
int m = l + r >> 1;
if (p <= m) update(i << 1, l, m, p, v);
else update(i << 1 | 1, m + 1, r, p, v);
st[i] = min(st[i << 1], st[i << 1 | 1]);
}
int get(int i, int l, int r, int u, int v) {
if (l > v || r < u) return INF;
if (u <= l && r <= v) return st[i];
int m = l + r >> 1;
return min(get(i << 1, l, m, u, v), get(i << 1 | 1, m + 1, r, u, v));
}
void process(void) {
vector <int> values(H + 1, H + 1 + N);
sort(ALL(values));
values.erase(unique(ALL(values)), values.end());
FORE(i, 1, N) {
H[i] = lower_bound(ALL(values), H[i]) - values.begin();
List[H[i]].push_back(i);
}
build(1, 1, N);
int l = 1, r = N;
Modular inv2 = Modular(2).inv(), res;
set <int> pos(ALL(List[0]));
for (int u: List[0]) update(1, 1, N, u, INF);
int mi = 0;
int last = -1;
while (l < r) {
while (!pos.empty() && *pos.begin() <= l) pos.erase(pos.begin());
while (!pos.empty() && *pos.rbegin() >= r) pos.erase(prev(pos.end()));
int v = min(H[l], H[r]);
if (pos.empty()) {
++mi;
if (mi == v) ++mi;
if (mi == max(H[l], H[r])) ++mi;
pos = set<int>(ALL(List[mi]));
}
while (last < mi) {
++last;
for (int u: List[last]) update(1, 1, N, u, INF);
}
if (mi < v) {
int tl = *pos.begin(), tr = *pos.rbegin(), cnt = pos.size();
int hl = get(1, 1, N, 1, tl - 1);
int hm = get(1, 1, N, tl + 1, tr - 1);
int hr = get(1, 1, N, tr + 1, N);
v = min({hl, hm, hr});
res += inv2 * cnt * (values[v] - values[mi]) * (values[v] + values[mi] - 1);
if (cnt == 1) res += Modular(values[hl] + values[hr]) * (values[v] - values[mi]);
else {
res += Modular((long long) values[hl] + values[hr] + values[v]) * (values[v] - values[mi]);
res += inv2 * (2 * cnt - 3) * (values[v] - values[mi]) * (values[v] + values[mi] + 1);
}
pos.insert(ALL(List[v]));
mi = v;
}
if (v == H[l]) ++l;
if (v == H[r]) --r;
}
cout << res << '\n';
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("cco23p2");
init();
process();
cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
