Leetcode 1359. Count All Valid Pickup and Delivery Options

Count the number of permutations of 2n events (n pickups and n deliveries) such that for each order i the delivery appears after its pickup — a combinatorics/permutation counting problem with rapidly growing results, return the count modulo 10^9+7 (1 ≤ n ≤ 500).