Given an integer n representing the total number of orders, where each order consists of a pickup and a delivery service.

Find the number of all valid sequences of pickup and delivery events such that the delivery of the $i$-th order always occurs after its corresponding pickup, for all $1 \le i \le$ n.

Since the total count may be very large, return the answer modulo $10^9 + 7$.

Constraints:

• $1 \le$ n $\le 500$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.