#include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<cmath>

 #include<algorithm>

 #define mod 1000000007

 using namespace std;

 int n,a[],wa[],s[];

 int lowbit(int x){return x&-x;}

 void add(int x,int p)

 {

     while(x<=n)

     {

         s[x]=(s[x]+p)%mod;

         x+=lowbit(x);

     }

 }

 int getsum(int x)

 {

     int ans=;

     while(x)

     {

         ans=(ans+s[x])%mod;

         x-=lowbit(x);

     }

     return ans;

 }/*

 int LS(int x)

 {

     int l,r,mid,ans;

     l=1,r=n;

     while(l<=r)

     {

         mid=(l+r)/2;

         if(wa[mid]<=x)

         {

             l=mid+1;

             ans=mid;

         }

         else r=mid-1;

     }

     return ans;

 }*/

 int f[],last[],w[];

 int main()

 {

     scanf("%d",&n);for(int i=;i<=n;i++)scanf("%d",&a[i]),wa[i]=a[i];

     sort(wa+,wa+n+);int sum=;memset(f,,sizeof(f));

     for(int i=;i<=n;i++)

     {

         a[i]=lower_bound(wa+,wa+n+,a[i])-wa;if(w[a[i]]==)sum++;

         last[i]=w[a[i]];w[a[i]]=i;//链表记录上次影响的位置

     }

     for(int i=;i<=n;i++)

     {

         f[i]=getsum(a[i]-)+;//这个数能贡献的上升子序列个数

         add(a[i],(f[i]-f[last[i]]+mod)%mod);//减去重复的贡献

     }

     int ans=getsum(n);

     printf("%d\n",(ans-sum+mod)%mod);

     return ;

 }