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

MOD = 10**9+7

import bisect

dp0 = [float('inf')]*(n+1)
dp0[0] = -float('inf')
# dp[i]: 長さiの増加部分列の末尾の要素の最小値（できないときはfloat('inf')

dp1 = [[float('inf')]*(n+1) for j in range(n+1)]
for i in range(n+1):
    dp1[i][0] = -float('inf')

cnt = [0]*(n+1)
cnt[0] = 1
M = 0

dp2 = [[0]*(n+1) for _ in range(n+1)]
dp2[0][1] = 1

for i in range(n):
  a = l[i]
  x = bisect.bisect_left(dp0, a)
  dp0[x] = min(dp0[x], a)
  cnt[x] += 1
  M = max(x, M)
  dp1[x][cnt[x]] = -a
  y = bisect.bisect(dp1[x-1], -a)-1
  dp2[x][cnt[x]] += (dp2[x][cnt[x]-1]+dp2[x-1][cnt[x-1]]-dp2[x-1][y])%MOD

#print(dp2)
#print(M)
print(dp2[M][cnt[M]])