#include<bits/stdc++.h>
using namespace std;
#define ll long long

const ll mod = 1e9 + 7;

ll pow_mod(ll a,ll b){
	ll ans = 1;
	while(b){
		if(b%2)
			ans = (ans*a)%mod;
		b/=2;
		a = (a*a)%mod;
	}
	return ans;
}
int main(){
	ll n;cin>>n;
	if(n == 2)
		cout<<"1\n";
	else
		cout<<(n*pow_mod(2,n-3))%mod<<'\n';
}