#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
//const ll mod = 1000000009;
//const ll mod = 998244353;
const ll mod = 1000003;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a,const T b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a,const T b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}
 
void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(15);
}
ll Sum(ll a,ll b){
  return (a+b)*(b-a+1)/2%mod;
}
struct Segtree{
  vector<ll> node;
  ll n;
  Segtree(vector<ll> A){
    n=1;
    while(n<A.size()) n*=2;
    node.resize(2*n);
    while(A.size()<n) A.pb(inf);
    for(int i=0;i<A.size();i++) node[i+n]=A[i];
    for(int i=n-1;i>=1;i--) node[i]=min(node[i*2],node[i*2+1]);
  }
  void set(int i){
    i+=n;
    node[i]=inf;
    i/=2;
    while(i){
      node[i]=min(node[i*2],node[i*2+1]);
      i/=2;
    }
  }
  ll prod(ll l,ll r,ll a,ll b,ll k){
    cerr<<l<<" "<<r<<" "<<a<<" "<<b<<" "<<k<<endl;
    if(r<=a||b<=l) return inf;
    if(l<=a&&b<=r) return node[k];
    return min(prod(l,r,a,(a+b)/2,2*k),prod(l,r,(a+b)/2,b,2*k+1));
  }
  ll prod(ll l,ll r){
    return prod(l,r,0,n,1);
  }
};
int main(){
  cincout();
  ll n;
  cin>>n;
  vector<ll> a(n);
  vcin(a);
  auto b=a,c=a,d=a;
  for(int i=1;i<n;i++) chmax(b[i],b[i-1]);
  for(int i=n-2;i>=0;i--) chmax(c[i],c[i+1]);
  for(int i=0;i<n;i++) d[i]=min(b[i],c[i]);
  ll ans=0;
  set<int> s;
  for(int i=0;i<n;i++) s.insert(a[i]);
  vector<ll> f;
  for(auto e:s) f.pb(e);
  map<int,int> memo;
  for(int i=0;i<f.size();i++) memo[f[i]]=i;
  vector<vector<int>> pu(f.size()),er(f.size());
  for(int i=0;i<n;i++){
    if(a[i]!=d[i]){
      pu[memo[a[i]]].pb(i);
      er[memo[d[i]]].pb(i);
    }
  }
  Segtree seg(a);
  set<int> id;
  for(int i=0;i+1<f.size();i++){
    for(auto e:pu[i]) id.insert(e);
    for(auto e:er[i]) id.erase(e);
    for(auto e:pu[i]){
      seg.set(e);
    }
    if(id.size()==0) continue;
    if(id.size()==1){
      int st=(*id.begin());
      ll v=seg.prod(0,st);
      ans+=v*(f[i+1]-f[i])%mod;
      v=seg.prod(st+1,n);
      ans+=v*(f[i+1]-f[i])%mod;
      ans+=Sum(f[i],f[i+1]-1);
      ans%=1000003;
    }
    else{
      ans+=ll(Sum(f[i]+1,f[i+1]))*(ll(id.size())*2-3);
      ans+=ll(Sum(f[i],f[i+1]-1))*ll(id.size());
      ll r=0;
      ans%=1000003;
      ll st=(*id.begin());
      ll v=seg.prod(0,st);
      auto itr=id.end();
      itr--;
      ll ed=(*itr);
    //  for(int j=0;j<st;j++) if(a[j]>f[i]) chmin(v,a[j]);
     // cout<<v<<" ";
      ans+=v*(f[i+1]-f[i])%mod;
      v=seg.prod(st+1,n);
    //  for(int j=st+1;j<n;j++) if(a[j]>f[i]) chmin(v,a[j]);
      chmax(r,v);
     // cout<<v<<" ";
      ans+=v*(f[i+1]-f[i])%mod;
      v=seg.prod(0,ed);
    //  for(int j=0;j<ed;j++) if(a[j]>f[i]) chmin(v,a[j]);
    //  cout<<v<<" ";
      ans+=v*(f[i+1]-f[i])%mod;
      chmax(r,v);
      v=seg.prod(ed+1,n);
   //   for(int j=ed+1;j<n;j++) if(a[j]>f[i]) chmin(v,a[j]);
     // cout<<v<<" ";
      ans+=v*(f[i+1]-f[i])%mod;
   //  cout<<r<<endl;
      ans-=r*(f[i+1]-f[i])%mod;
      ans%=1000003;
      ans+=1000003;
      ans%=1000003;
    }
  }
  cout<<ans<<endl;
}