CSES - Shared codeLink to this code: https://cses.fi/paste/98a2da5e2b4745334865d8/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef pair<int,int>pr;
#define all(i) i.begin() , i.end()
#define ft first
#define sn second
#define pb push_back
const int mod = 1e9+7;
#define en "\n"
#define dbg cout<<"rony\n";
#define MAXN 1000010
int D[MAXN];
ll f(ll n)
{
if(n == 1) return 0;
if(n == 2) return 1;
if(D[n] != -1) return D[n];
int an;
an = ((f(n - 2) + f(n - 1)) % mod);
an = (an * (n - 1))%mod;
return D[n] = an;
}
void solve()
{
int n;
cin >> n;
for(int i = 0;i <= n;i++) D[i] = -1;
cout<<f(n)%mod<<endl;
}
int main()
{
IOS;
int t;
// cin >> t;
t = 1;
while ( t-- )
{
solve();
}
return 0;
}