import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.NoSuchElementException;

class Main {
	public static void main(String[] args) throws Exception {
		new Main().run();
	}
	
	class SegTree{
		int n;
		long[][] v;
		
		public SegTree(int n_) {
			n=1;
			while(n<n_)n*=2;
			v=new long[2*n-1][2];//最長増加列の長さ,最長増加列の個数
		}
		
		void update(int k,long[] val) {
			k+=n-1;
			v[k]=merge(v[k],val);
			while(k>0) {
				k=(k-1)/2;
				v[k]=merge(v[2*k+1], v[2*k+2]);
			}
		}
		
		long[] query(int a,int b) {
			return query(0,n,a,b,0);
		}
		
		long[] query(int l,int r,int a,int b,int k) {
			if(a<=l&&r<=b)return v[k];
			else if(r<=a||b<=l)return new long[] {0,0}; 
			else {
				long[] lv=query(l,(l+r)/2,a,b,2*k+1);
				long[] rv=query((l+r)/2,r,a,b,2*k+2);
				return merge(lv,rv);
			}
		}
		
		long[] merge(long[] a,long[] b) {
			long[] ret=new long[2];
			ret[0]=Math.max(a[0], b[0]);
			if(ret[0]==a[0])ret[1]+=a[1];
			if(ret[0]==b[0])ret[1]+=b[1];
			ret[1]%=M;
			return ret;
		}
	}
	
	long[] shrink(long[] a) {
		long[] x=new long[a.length];
		long[] ret=new long[a.length];
		for(int i=0;i<a.length;++i) {
			x[i]=(a[i]<<32)|i;
		}
		Arrays.sort(x);
		int p=0;
		for(int i=0;i<x.length;++i) {
			int j=i;
			ret[(int)x[i]]=p;
			while(j+1<x.length&&(x[i]>>32)==(x[j+1]>>32)) {
				++j;
				ret[(int)x[j]]=p;
			}
			i=j;
			++p;
		}
		return ret;
	}
	
	final long M=(long)1e9+7;
	
	//最長増加列の長さ,最長増加列の個数
	
	void run() {
		Scanner sc=new Scanner();
		int N=sc.nextInt();
		long[] A=new long[N];
		for(int i=0;i<N;++i) {
			A[i]=sc.nextLong();
		}
		SegTree seg=new SegTree(N);
		A=shrink(A);
		for(int i=0;i<N;++i) {
			long[] v=seg.query(0, (int)A[i]);
			if(v[1]==0) {
				v[0]=1;
				v[1]=1;
			}else {
				v[0]++;
			}
			seg.update((int)A[i], v);
		}
		System.out.println(seg.query(0, N)[1]);
	}
	
	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}

class Scanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}