# 解説を読みました
# https://stackoverflow.com/questions/22923646/number-of-all-longest-increasing-subsequences

from bisect import bisect_left

mod = 10**9+7

n = int(input())
a = list(map(int, input().split()))

row = [float("inf")]*n
cumsum = [[0] for i in range(n)]
nums = [[] for i in range(n)]
for ai in a:
    i = bisect_left(row, ai)
    add = (row[i] == ai)
    row[i] = ai
    if i == 0:
        count = 1
    else:
        j = bisect_left(nums[i-1], -ai+1)
        count = cumsum[i-1][-1] - cumsum[i-1][j]
    if add:
        cumsum[i][-1] += count
    else:
        cumsum[i].append(cumsum[i][-1]+count)
        nums[i].append(-ai)
    cumsum[i][-1] %= mod

i = bisect_left(row, float("inf"))
ans = cumsum[i-1][-1]%mod
print(ans)