n = int(input())
A = list(map(int, input().split()))
mod = 10**9+7

d = {}
B = list(set(A))
B.sort()
for i, b in enumerate(B):
    d[b] = i+1
A = [d[a] for a in A]

class SegTree:
    def __init__(self, init_val, ide_ele, segfunc):
        self.n = len(init_val)
        self.num = 2**(self.n-1).bit_length()
        self.ide_ele = ide_ele
        self.segfunc = segfunc
        self.seg = [ide_ele]*2*self.num
        # set_val
        for i in range(self.n):
            self.seg[i+self.num] = init_val[i]
        # built
        for i in range(self.num-1, 0, -1):
            self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])

    def update(self, k, x):
        k += self.num
        self.seg[k] = x
        while k:
            k = k >> 1
            self.seg[k] = self.segfunc(self.seg[2*k], self.seg[2*k+1])

    def query(self, l, r):
        if r <= l:
            return self.ide_ele
        l += self.num
        r += self.num
        lres = self.ide_ele
        rres = self.ide_ele
        while l < r:
            if r & 1:
                r -= 1
                rres = self.segfunc(self.seg[r], rres)
            if l & 1:
                lres = self.segfunc(lres, self.seg[l])
                l += 1
            l = l >> 1
            r = r >> 1
        res = self.segfunc(lres, rres)
        return res

def segfunc(x, y):
    if x[0] == y[0]:
        return (x[0], x[1]+y[1])
    elif x[0] > y[0]:
        return x
    else:
        return y

seg = SegTree([(-1, 0)]*(n+1), (-1, 0), segfunc)
seg.update(0, (0, 1))
for a in A:
    x = seg.query(a, a+1)
    y = seg.query(0, a)
    if y[0] < x[0]:
        seg.update(a, (x[0], y[1]+x[1]))
    else:
        seg.update(a, (y[0]+1, y[1]))
ans = seg.query(0, n+1)
print(ans[1]%mod)