{"raw_statement":[{"iden":"problem statement","content":"Let $N$ be a positive integer. You are given a string $s$ of length $N - 1$, consisting of `<` and `>`.\nFind the number of permutations $(p_1, p_2, \\ldots, p_N)$ of $(1, 2, \\ldots, N)$ that satisfy the following condition, modulo $10^9 + 7$:\n\n*   For each $i$ ($1 \\leq i \\leq N - 1$), $p_i < p_{i + 1}$ if the $i$\\-th character in $s$ is `<`, and $p_i > p_{i + 1}$ if the $i$\\-th character in $s$ is `>`."},{"iden":"constraints","content":"*   $N$ is an integer.\n*   $2 \\leq N \\leq 3000$\n*   $s$ is a string of length $N - 1$.\n*   $s$ consists of `<` and `>`."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$s$"},{"iden":"sample input 1","content":"4\n<><"},{"iden":"sample output 1","content":"5\n\nThere are five permutations that satisfy the condition, as follows:\n\n*   $(1, 3, 2, 4)$\n*   $(1, 4, 2, 3)$\n*   $(2, 3, 1, 4)$\n*   $(2, 4, 1, 3)$\n*   $(3, 4, 1, 2)$"},{"iden":"sample input 2","content":"5\n<<<<"},{"iden":"sample output 2","content":"1\n\nThere is one permutation that satisfies the condition, as follows:\n\n*   $(1, 2, 3, 4, 5)$"},{"iden":"sample input 3","content":"20\n>>>><>>><>><>>><<>>"},{"iden":"sample output 3","content":"217136290\n\nBe sure to print the number modulo $10^9 + 7$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}