import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum long mod = 10^^9 + 7;

void main() {
    int n;
    scan(n);

    auto a = new long[](n + 1);
    auto s = new long[](2);
    a[1] = 1;
    s[1] = 1;

    foreach (i ; 2 .. n + 1) {
        a[i] = s[i&1^1] * i % mod;
        (s[i&1] += a[i]) %= mod;
    }

    writeln(a[n]);
}





void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}