class Solution {
    public int countOrders(int n) {
        long f = 1;
        for(int i=2; i<=n; i++){
            f = f * i * (2*i - 1) % 1000000007;
        }
        return (int)(f);
    }
}