Calculate the number of valid bracket sequences of length n.
For example, when n = 6, there are 5 sequences:
()()() ()(()) (())() ((())) (()())
One integer n~(1 \le n \le 10^6).
Print the number of sequences modulo 10^9 + 7.
Example 1