#include<algorithm>
#include<cstdio>
#include<sstream>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<iostream>
#include<fstream>
#include<numeric>
#include<string>
#include<vector>
#include<cstring>
#include<map>
#include<iterator>
#include<deque>
#include<climits>
#include<complex>
#include<string.h>


using namespace std;
//-------------------------------------

#define ll long long
#define ull unsigned long long
#define sc(x) scanf("%lld",&x)
#define sc2(x,y) scanf("%lld%lld",&x,&y)
#define sci(x) scanf("%d",&x)
#define sci2(x,y) scanf("%d%d",&x,&y)

#define rep(i,a,n) for(int i=a;i<n;i++)
#define F(i,n) for(int i=0;i<n;i++)
#define mem(x) memset(x,0,sizeof x)
#define all(x) x.begin(),x.end()
#define xx first
#define yy second
#define inf 99999999999999999
#define mkp(x,y) make_pair(x,y)
#define pii pair<ll,ll>
#define pb(x)  push_back(x);
#define uni(vc) vc.resize(unique(all(vc))-vc.begin())
#define db(x) cout<<#x<<" "<<x<<endl;
#define ml(inp) sizeof(inp)/1e6

//---------------------------------------9 12 13 14 15 21 22

#define MX 200007

#define pi 2*acos(0.00)

#define open       freopen("input.txt","r",stdin)

ll mod = 1e9 + 7;
ll pw(int x,int y)
{
    ll ans = 1;
    for(int i=1; i<=y; i++)
    {
        ans*=x;
        if(ans>mod) ans%=mod;
    }
//    cout<<x<<" "<<y<<endl;
//    cout<<ans<<endl;
    return ans;
}
int main()
{

    ll l, u, v, w, x, y, z, a, b, c, d, e, f, t = 1, tc;
    ll flg, sz, cnt, gt, ans, mx, mn;
    ll m, k, n,i,j;
    ll low, hi, md, inp[MX], sm, ff;

    sc(n);
    ans = 1;
    rep(i,0,n) cin >> inp[i];

    int ase[MX][3];
    ase[0][1]=0;
    ase[0][2]=0;
    int ls=0;
    rep(i,1,n)
    {

        ase[i][1]=i;
        ase[i][2]=i;
        ff=1;
        if(inp[i]<=inp[i-1])
        {
            for(int j=i-1; j>=ls; j--) ase[j][2]=i-1;
            ls =i;
            ff=0;
        }

    }
    if(ff)
    {
        for(int j=i-1; j>=ls; j--) ase[j][2]=i-1;

    }
//    rep(i,0,n) cout<<ase[i][1]<<" "<<ase[i][1]<<endl;
    rep(i,1,n)
    {
        if(inp[i]>=inp[i-1])
        {
            int gp = i+1;
            ll tot =1 ;
            for(int j=i+1; j<n; j++)
            {
                a = ase[j][2]-ase[j][1]+1;
                gt = pw(gp,a);
                tot *= gt;
                tot %=mod;
                j = ase[j][2];
            }
            ans += tot;
        }
        else break;
    }
    cout<<ans<<endl;


    return 0;

}


/*


*/
//rep(i,1,4000) fct[i] = (i*fct[i-1]) % mod;
//    sc(n);
//    rep(i,1,n+1)
//    {
//        ncr[0][i]=1;
//        ncr[i][0]=1;
//        rep(j,1,i+1)
//        {
//            ncr[i][j]=ncr[i-1][j] + ncr[i-1][j-1];
//            if(ncr[i][j]>mod) ncr[i][j]%=mod;
//        }
//    }