using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	const long mod = (long)1e9 + 7;
	public void Solve(){
		
		if(N == 1){
			Console.WriteLine(1);
			return;
		}
		
		var BT = new BIT[2];
		for(int i=0;i<2;i++) BT[i] = new BIT(N+10);
		
		BT[1].Add(1,1);
		long ans = 0;
		for(int i=2;i<=N;i++){
			var a = i * BT[(i%2) ^ 1].Sum(i);
			if(a >= mod) a %= mod;
			BT[i%2].Add(i,a);
			if(i == N) ans = a;
		}
		Console.WriteLine(ans);
		
	}
	int N;
	public Sol(){
		N = ri();
	}

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}

class BIT{
	int MM;
	int n;
	long[] bit;
	const long mod = (long)1e9 + 7;
	public BIT(int n_){
		n=n_;
		MM=1<<18;
		while(MM<n*2)MM<<=1;
		bit=new long[MM+1];
	}
	//1-origin!!
	public void Add(int i,long x){
		while(i<=n){
			bit[i]+=x;if(bit[i] >= mod) bit[i] -= mod;
			i+=(i&-i);
		}
	}
	
	// i=>sum(a_1,...,a_i)
	// i=0 -> return 0;
	public long Sum(int i){
		long s=0;
		while(i>0){
			s+=bit[i]; if(s >= mod) s -= mod;
			i-= (i&-i);
		}
		return s;
	}
}