from bisect import *
from copy import *
def compress(lst):
    B = []
    D = dict()
    vals = deepcopy(lst)
    vals = list(set(vals))
    vals.sort()
    for i in range(len(lst)):
        ind = bisect_left(vals, lst[i])
        B.append(ind)
    for i in range(len(B)):
        D[lst[i]] = B[i]
    return B, D, vals

class SegmentTree:
    def __init__(self,
                 n,
                 identity_e,
                 combine_f,
                 ):
        self._n = n
        self._size = 1
        while self._size < self._n:
            self._size <<= 1
        self._identity_e = identity_e
        self._combine_f = combine_f
        self._node = [self._identity_e] * (2 * self._size)
        
    def build(self, array):
        assert len(array) == self._n
        for index, value in enumerate(array, start=self._size):
            self._node[index] = value
        for index in range(self._size - 1, 0, -1):
            self._node[index] = self._combine_f(
                self._node[index << 1 | 0],
                self._node[index << 1 | 1]
            )
            
    def update(self, index, value):
        i = self._size + index
        self._node[i] = value
        while i > 1:
            i >>= 1
            self._node[i] = self._combine_f(
                self._node[i << 1 | 0],
                self._node[i << 1 | 1]
            )
            
    def fold(self, L, R):
        L += self._size
        R += self._size
        value_L = self._identity_e
        value_R = self._identity_e
        while L < R:
            if L & 1:
                value_L = self._combine_f(value_L, self._node[L])
                L += 1
            if R & 1:
                R -= 1
                value_R = self._combine_f(self._node[R], value_R)
            L >>= 1
            R >>= 1
        
        return self._combine_f(value_L, value_R)
    
    
N = int(input())
A = list(map(int, input().split())) + [-10**18]
A = compress(A)[0]
mod = 10 ** 9 + 7

def op(t1, t2):
    m1, v1 = t1
    m2, v2 = t2
    if m1 == m2:
        return m1, (v1 + v2) % mod
    elif m1 > m2:
        return t1
    else:
        return t2

T = SegmentTree(N + 1, (0, 0), op)
T.update(0, (1, 1))
for i in range(N):
    t = T.fold(0, A[i])
    now = T.fold(A[i], A[i] + 1)
    T.update(A[i], op((t[0] + 1, t[1]), now))

print(T.fold(0, N + 1)[1] % mod)