#include <iostream>

#include <stdio.h>

#include <string.h>

#include <stack>

#include <vector>

#include <algorithm>

using namespace std;

typedef long long LL;

const int N = ;

const int mod = ;

int n;

int a[N],b[N],c[N];

int lowbit(int x){

    return x&(-x);

}

void update(int idx,int v){

    for(int i=idx;i<=n;i+=lowbit(i)){

        c[i]=(c[i]+v)%mod;

    }

}

int getsum(int idx){

    int sum = ;

    for(int i=idx;i>=;i-=lowbit(i)){

        sum = (sum+c[i])%mod;

    }

    return sum;

}

int main()

{

    while(scanf("%d",&n)!=EOF){

        memset(c,,sizeof(c));

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

            scanf("%d",&a[i]);

            b[i] = a[i];

        }

        sort(b+,b++n);

        int ans = ;

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

            int idx = lower_bound(b+,b++n,a[i])-b;

            ans=getsum(idx);

            update(idx,ans+);

        }

        printf("%d\n",getsum(n));

    }

    return ;

}