#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


constexpr int MO = 1'000'003;
constexpr Int INF = 1001001001001001001LL;

int N;
vector<Int> A;

int main() {
  for (; ~scanf("%d", &N); ) {
    A.assign(N + 2, INF);
    for (int i = 1; i <= N; ++i) {
      scanf("%lld", &A[i]);
    }
    
    // strict
    vector<int> prv(N + 2, 0), nxt(N + 2, N + 1);
    
    Int ans = 0;
    auto as = A;
    for (; ; ) {
// cerr<<as<<" "<<ans<<endl;
      for (int i = 1; i <= N; ++i) {
        int &j = prv[i] = i - 1;
        for (; as[j] <= as[i]; j = prv[j]) {}
      }
      for (int i = N; i >= 1; --i) {
        int &j = nxt[i] = i + 1;
        for (; as[j] <= as[i]; j = nxt[j]) {}
      }
      Int mn = INF;
      for (int i = 1; i <= N; ++i) if (1 <= prv[i] && nxt[i] <= N) {
        chmin(mn, as[i]);
      }
      if (mn >= INF) {
        break;
      }
      int lm = N + 1, rm = 0;
      int cnt = 0;
      for (int i = 1; i <= N; ++i) if (1 <= prv[i] && nxt[i] <= N) {
        if (mn == as[i]) {
          chmin(lm, i);
          chmax(rm, i);
          ++cnt;
        }
      }
      
      auto calc = [&](int l, int r) -> Int {
        Int ret = INF;
        for (int i = l; i <= r; ++i) if (mn < as[i]) {
          chmin(ret, as[i]);
        }
        return ret;
      };
      const Int costLL = calc(1, lm - 1);
      const Int costLR = calc(lm + 1, N);
      const Int costRL = calc(1, rm - 1);
      const Int costRR = calc(rm + 1, N);
      const Int tar = min({costLL, costLR, costRL, costRR});
      if (cnt == 1) {
        ans += (tar - mn) * (costLL + costLR);
        ans += tar*(tar-1)/2 - mn*(mn-1)/2;
      } else {
        ans += (tar - mn) * (costLL + min(costLR, costRL) + costRR);
        ans += 3 * (tar*(tar-1)/2 - mn*(mn-1)/2);
        ans += (tar - mn);
        ans += (cnt - 2) * ((3 * (tar*(tar-1)/2 - mn*(mn-1)/2)) % MO);
        ans += (cnt - 2) * ((2 * (tar - mn)) % MO);
      }
      ans %= MO;
      
      for (int i = 1; i <= N; ++i) if (1 <= prv[i] && nxt[i] <= N) {
        if (mn == as[i]) {
          as[i] = tar;
        }
      }
    }
    
    printf("%lld\n", ans);
  }
  return 0;
}