import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in Actual solution is at the top
 *
 * @author ilyakor
 */
public class Main {

  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    InputReader in = new InputReader(inputStream);
    OutputWriter out = new OutputWriter(outputStream);
    TaskC solver = new TaskC();
    solver.solve(1, in, out);
    out.close();
  }

  static class TaskC {

    static final int mod = 1000 * 1000 * 1000 + 7;
    static final int maxn = 1010 * 1000;
    static int[] f = new int[maxn];
    static int[] rf = new int[maxn];

    static {
      f[0] = 1;
      rf[0] = 1;
      for (int i = 1; i < maxn; ++i) {
        f[i] = (int) ((f[i - 1] * (long) i) % mod);
        rf[i] = IntegerUtils.pow(f[i], mod - 2, mod);
      }
    }

    public void solve(int testNumber, InputReader in, OutputWriter out) {
      int n = in.nextInt();
      // int[] a = new int[n - 1];
      // for (int i = 0; i < n - 1; ++i)
      //     a[i] = i;
      // int res = 0;
      // do {
      //     int cur = 0;
      //     boolean[] u = new boolean[n];
      //     int left = n;
      //     while (cur < n) {
      //         if (!u[a[cur]])
      //             --left;
      //         if (!u[a[cur] + 1])
      //             --left;
      //         u[a[cur]] = true;
      //         u[a[cur] + 1] = true;
      //         ++cur;
      //         if (left == 0) break;
      //     }
      //     res += cur;
      // } while (Permutations.nextPermutation(a));
      // out.printLine(res);

      long res = 0;
      for (int k = 0; k < n; ++k) {
        res += bad(n, k);
        res %= mod;
      }
      out.printLine(res);
    }

    private long bad(int n, int k) {
      int missing = n - 1 - k;
      long good = C(n - 2 - missing, missing);
      good *= f[missing];
      good %= mod;
      good *= f[n - 1 - missing];
      good %= mod;
      long bad = f[n - 1] - good;
      bad = (bad % mod + mod) % mod;
      return bad;
    }

    private long C(int n, int k) {
      if (k < 0 || k > n) {
        return 0;
      }
      return ((f[n] * (long) rf[k]) % mod * (long) rf[n - k]) % mod;
    }

  }

  static class InputReader {

    private InputStream stream;
    private byte[] buffer = new byte[10000];
    private int cur;
    private int count;

    public InputReader(InputStream stream) {
      this.stream = stream;
    }

    public static boolean isSpace(int c) {
      return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public int read() {
      if (count == -1) {
        throw new InputMismatchException();
      }
      try {
        if (cur >= count) {
          cur = 0;
          count = stream.read(buffer);
          if (count <= 0) {
            return -1;
          }
        }
      } catch (IOException e) {
        throw new InputMismatchException();
      }
      return buffer[cur++];
    }

    public int readSkipSpace() {
      int c;
      do {
        c = read();
      } while (isSpace(c));
      return c;
    }

    public int nextInt() {
      int sgn = 1;
      int c = readSkipSpace();
      if (c == '-') {
        sgn = -1;
        c = read();
      }
      int res = 0;
      do {
        if (c < '0' || c > '9') {
          throw new InputMismatchException();
        }
        res = res * 10 + c - '0';
        c = read();
      } while (!isSpace(c));
      res *= sgn;
      return res;
    }

  }

  static class OutputWriter {

    private final PrintWriter writer;

    public OutputWriter(OutputStream outputStream) {
      writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
    }

    public OutputWriter(Writer writer) {
      this.writer = new PrintWriter(writer);
    }

    public void print(Object... objects) {
      for (int i = 0; i < objects.length; i++) {
        if (i != 0) {
          writer.print(' ');
        }
        writer.print(objects[i]);
      }
    }

    public void printLine(Object... objects) {
      print(objects);
      writer.println();
    }

    public void close() {
      writer.close();
    }

  }

  static class IntegerUtils {

    public static int pow(long x, long y, int mod) {
      x %= mod;
      long res = 1;
      while (y > 0) {
        if (y % 2 == 1) {
          --y;
          res = (res * x) % mod;
        } else {
          y /= 2;
          x = (x * x) % mod;
        }
      }
      return (int) (res % mod);
    }

  }
}



Measured memory_bytes: 32252