#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<bitset>
#include<cassert>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i,n) for ((i)=(n);(i)>=1;(i)--)
#define fz0g(i,n) for ((i)=0;(i)<=(n);(i)++)
#define fd0g(i,n) for ((i)=(n);(i)>=0;(i)--)
#define fz0k(i,n) for ((i)=0;(i)<(n);(i)++)
#define fd0k(i,n) for ((i)=(((long long)(n))-1);(i)>=0;(i)--)
#define fz(i,x,y) for ((i)=(x);(i)<=(y);(i)++)
#define fd(i,y,x) for ((i)=(y);(i)>=(x);(i)--)
#define fzin fz1(i,n)
#define fzim fz1(i,m)
#define fzjn fz1(j,n)
#define fzjm fz1(j,m)
#define ff(c,itr) for (__typeof((c).begin()) itr=(c).begin();itr!=(c).end();++itr)
#define pb push_back
#define mk make_pair
#define rdst(st,len){static char ss[len];scanf(" %s",ss);(st)=ss;}
#define spln(i,n) (i==n?'\n':' ')
#define fac_init(n){fac[0]=fac[1]=inv[1]=fi[0]=fi[1]=1;fz(i,2,n){fac[i]=1ll*fac[i-1]*i%mod;inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;fi[i]=1ll*fi[i-1]*inv[i]%mod;}}
using namespace std;
typedef long long i64;
typedef long double f80;
typedef unsigned int u32;
typedef unsigned long long u64;
//typedef __int128 i128;
//typedef unsigned __int128 u128;
#ifndef ONLINE_JUDGE
	FILE *___=freopen("1.in","r",stdin);
#endif
inline void read(int &x)
{
	char c;int f=1;
	while(!isdigit(c=getchar()))if(c=='-')f=-1;
	x=(c&15);while(isdigit(c=getchar()))x=(x<<1)+(x<<3)+(c&15);
	x*=f;
}
const int mod=1e6+3;
int n,m,i,j,a[1000005],b[1000005],c[1000005],ans;
bool check()
{
	int p=1,i;fz1(i,n)if(a[i]>a[p])p=i;
	for(i=p-1;i;i--)if(a[i]>a[i+1])return 0;
	for(i=p+1;i<=n;i++)if(a[i]>a[i-1])return 0;
	return 1;
}
int main()
{
	read(n);fz1(i,n)read(a[i]);
	while(!check()){
//		fz1(i,n)cerr<<a[i]<<' ';cerr<<endl;
		int mi=0x3f3f3f3f;fz1(i,n)mi=min(mi,a[i]);
		int l=n+1,r=0;fz1(i,n)if(a[i]==mi)l=min(l,i),r=max(r,i);
		assert(l>1&&r<n);
		if(a[l-1]>a[r+1]) ans=(0ll+ans+a[l-1]+a[r+1]+a[l])%mod,a[l]++;
		else ans=(0ll+ans+a[l-1]+a[r+1]+a[r])%mod,a[r]++;
	}
	printf("%d\n",ans);
	return 0;
}