import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;
 
import static java.util.Comparator.*;
 
public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==================================================================
    long MOD = 1000000007;
    public void solve() {
    	int N = Integer.parseInt(sc.next());
    	if(N == 1) {
    		out.println(1);
    		return;
    	}
    	long g = 0, k = 1;
    	for (int i = 2; i < N; i++) {
			if(i % 2 == 0)	g = (g + (k * i) % MOD) % MOD;
			else			k = (k + (g * i) % MOD) % MOD;
		}
    	long ans;
    	if(N % 2 == 0)	ans = (k * N) % MOD;
    	else			ans = (g * N) % MOD;
    	out.println(ans);
    }
}