Programming teacher Dmitry Olegovich is going to propose the following task for one of his tests for students:

You are given a tree T with n vertices, specified by its adjacency matrix a[1... n, 1... n]. What is the output of the following pseudocode?
    
    
      
    used[1 ... n] = {0, ..., 0};  
      
    procedure dfs(v):  
        print v;  
        used[v] = 1;  
        for i = 1, 2, ..., n:  
            if (a[v][i] == 1 and used[i] == 0):  
                dfs(i);  
      
    dfs(1);  
    

In order to simplify the test results checking procedure, Dmitry Olegovich decided to create a tree T such that the result is his favorite sequence b. On the other hand, Dmitry Olegovich doesn't want to provide students with same trees as input, otherwise they might cheat. That's why Dmitry Olegovich is trying to find out the number of different trees T such that the result of running the above pseudocode with T as input is exactly the sequence b. Can you help him?

Two trees with n vertices are called different if their adjacency matrices a1 and a2 are different, i. e. there exists a pair (i, j), such that 1 ≤ i, j ≤ n and a1[i][j] ≠ a2[i][j].

Input

The first line contains the positive integer n (1 ≤ n ≤ 500) — the length of sequence b. 

The second line contains n positive integers b1, b2, ..., bn (1 ≤ bi ≤ n). It is guaranteed that b is a permutation, or in other words, each of the numbers 1, 2, ..., n appears exactly once in the sequence b. Also it is guaranteed that b1 = 1.

Output

Output the number of trees satisfying the conditions above modulo 109 + 7.

Examples

Input

3
1 2 3


Output

2


Input

3
1 3 2


Output

1
import java.util.Arrays;
import java.util.Scanner;

public class CF289F {
    static int[] a;
    static int[][] dp;
    static int MOD = 1_000_000_007;

    static int f(int l, int r) {
        if (l >= r)
            return 1;
        if (dp[l][r] != -1)
            return dp[l][r];
        long answer = 0;
        for (int k = l + 1; k <= r + 1; k++)
            if (k == r + 1 || a[k] >= a[l])
                answer = (answer + f(l + 1, k - 1) * 1L * f(k, r) % MOD) % MOD;
        return dp[l][r] = (int) answer;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        dp = new int[n][n];
        for (int[] a : dp)
            Arrays.fill(a, -1);
        a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = in.nextInt();
        System.out.println(f(1, n - 1));
    }
}
