//User function Template for C++

class Solution{

public:

        int mod=1e9+7;

        long long ans = 0;

        void solve(int n, int ind, int m){

            if(ind > n){

                return;

            }

            long long result = 1;

            for(int i=0; i < ind; i++){

                result = (result*m)%mod;

                m++;

            }

            ans+=result;

            solve(n, ind+1, m); 

        } 

    long long sequence(int n){

        // code here

        solve(n,1,1);

        // int trk = 1;

        // for(int i=1; i<=n; i++){

        //     ans += ans;

        //     for(int j=1; j<=i; j++){

        //         ans = ans*trk;

        //         trk++;

        //     }

        // }

        return ans%mod;;

    }

};