#include<cstdio>

#include<cstring>

#include<cctype>

#include<algorithm>

using namespace std;

#define rep(i,s,t) for(int i=s;i<=t;i++)

#define dwn(i,s,t) for(int i=s;i>=t;i--)

#define clr(x,c) memset(x,c,sizeof(x))

#define lson l,mid,x<<1

#define rson mid+1,r,x<<1|1

int read(){

	int x=0;char c=getchar();

	while(!isdigit(c)) c=getchar();

	while(isdigit(c)) x=x*10+c-'0',c=getchar();

	return x;

}

const int nmax=5e4+5;

const int inf=0x7f7f7f7f;

const int mod=1e9+7;

int a[nmax],b[nmax],mx[nmax<<2],sm[nmax<<2];

int qmax(int tl,int tr,int l,int r,int x){

	if(tl<=l&&tr>=r) return mx[x];

	int mid=(l+r)>>1,ans=0;

	if(tl<=mid) ans=max(ans,qmax(tl,tr,lson));

	if(tr>mid) ans=max(ans,qmax(tl,tr,rson));

	return ans;

}

int query(int tl,int tr,int p,int l,int r,int x){

	if(tl<=l&&tr>=r) return mx[x]==p?sm[x]:0;

	int mid=(l+r)>>1,ans=0;

	if(tl<=mid) ans+=query(tl,tr,p,lson);

	if(tr>mid) ans+=query(tl,tr,p,rson);

	return ans>=mod?ans-mod:ans;

}

void update(int p,int a,int b,int l,int r,int x){

	if(mx[x]<a) mx[x]=a,sm[x]=b;

	else if(mx[x]==a) sm[x]=(sm[x]+b)%mod;

	if(l==r) return ;

	int mid=(l+r)>>1;

	p<=mid?update(p,a,b,lson):update(p,a,b,rson);

}

void print(int l,int r,int x){

	printf("%d %d:%d %d\n",l,r,mx[x],sm[x]);

	if(l==r) return ;

	int mid=(l+r)>>1;

	print(lson);print(rson);

}

int main(){

	int n=read();rep(i,1,n) a[i]=b[i]=read();

	sort(b+1,b+n+1);int cnt=unique(b+1,b+n+1)-b-1;

	rep(i,1,n) a[i]=lower_bound(b+1,b+cnt+1,a[i])-b;

	int u,v,d;

	rep(i,1,n){

		u=a[i]==1?1:qmax(1,a[i]-1,1,cnt,1)+1;

		v=u==1?1:query(1,a[i]-1,u-1,1,cnt,1);

		update(a[i],u,v,1,cnt,1);

		/*printf("->%d %d\n",u,v);

		printf("->_->\n");print(1,cnt,1);*/

	}

	printf("%d\n",sm[1]);

	return 0;

}