#include <iostream>
#include <vector>
#include <bits/stdc++.h>


using namespace std;
using ll = long long;

const ll mod = 1000'000'007;

ll modpow(ll b, ll e){
    ll ans = 1;
    for(; e;  b = b*b % mod, e/= 2){
        if(e&1) ans = ans*b%mod;
    }
    return ans;
}

int main() {
    ll n;
    cin >> n;
    if(n == 2){
        cout << 1 << endl;
        return 0;
    }
    cout << (n* modpow(2, n-3)) % mod << endl;

}