import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.NoSuchElementException;


public class Main {
  private static long pow_mod(long b, long e, long mod) {
    long ret = 1;
    for (; e > 0; e >>= 1, b = b * b % mod) {
      if ((e & 1) == 1)
        ret = ret * b % mod;
    }
    return ret;
  }

  private static long fact_valuation(long n, long p) {
    long ret = n /= p;
    while (n >= p) {
      n /= p;
      ret += n;
    }
    return ret;
  }

  private static int[] d = {6, 4, 2, 4, 2, 4, 6, 2};

  private static long fact_mod(long n, long p) {
    if (n >= p)
      return 0;
    if (n * 2 > p) {
      long ret = fact_mod(p - n - 1, p);
      ret = ((p - n - 1) & 1) == 1 ? ret : p - ret;
      return pow_mod(ret, p - 2, p);
    }
    List<Long> ns = new ArrayList<>();
    for (long i = n; i > 1; i /= 5)
      for (long j = i; j > 1; j /= 3)
        for (long k = j; k > 1; k >>= 1)
          ns.add(k);

    Collections.sort(ns);


    long ret = 1, prod = 1, i = 1, r = 0;
    for (long end : ns) {
      for (; i <= end; i += d[(int) (r & 7)], ++r) {
        prod = prod * i % p;
      }
      ret = ret * prod % p;
    }
    ret = ret * pow_mod(2, fact_valuation(n, 2L), p) % p;
    ret = ret * pow_mod(3, fact_valuation(n, 3L), p) % p;
    ret = ret * pow_mod(5, fact_valuation(n, 5L), p) % p;
    return ret;
  }

  public static void main(String[] args) {
    FastScanner sc = new FastScanner();

    long mod = 1000000000 + 7;
    long N = sc.nextLong();
    System.out.println(fact_mod(N, mod));
  }
}


class FastScanner {
  public static String debug = null;

  private final InputStream in = System.in;
  private int ptr = 0;
  private int buflen = 0;
  private byte[] buffer = new byte[1024];
  private boolean eos = false;

  private boolean hasNextByte() {
    if (ptr < buflen) {
      return true;
    } else {
      ptr = 0;
      try {
        if (debug != null) {
          buflen = debug.length();
          buffer = debug.getBytes();
          debug = "";
          eos = true;
        } else {
          buflen = in.read(buffer);
        }
      } catch (IOException e) {
        e.printStackTrace();
      }
      if (buflen < 0) {
        eos = true;
        return false;
      } else if (buflen == 0) {
        return false;
      }
    }
    return true;
  }

  private int readByte() {
    if (hasNextByte())
      return buffer[ptr++];
    else
      return -1;
  }

  private static boolean isPrintableChar(int c) {
    return 33 <= c && c <= 126;
  }

  private void skipUnprintable() {
    while (hasNextByte() && !isPrintableChar(buffer[ptr]))
      ptr++;
  }

  public boolean isEOS() {
    return this.eos;
  }

  public boolean hasNext() {
    skipUnprintable();
    return hasNextByte();
  }

  public String next() {
    if (!hasNext())
      throw new NoSuchElementException();
    StringBuilder sb = new StringBuilder();
    int b = readByte();
    while (isPrintableChar(b)) {
      sb.appendCodePoint(b);
      b = readByte();
    }
    return sb.toString();
  }

  public long nextLong() {
    if (!hasNext())
      throw new NoSuchElementException();
    long n = 0;
    boolean minus = false;
    int b = readByte();
    if (b == '-') {
      minus = true;
      b = readByte();
    }
    if (b < '0' || '9' < b) {
      throw new NumberFormatException();
    }
    while (true) {
      if ('0' <= b && b <= '9') {
        n *= 10;
        n += b - '0';
      } else if (b == -1 || !isPrintableChar(b)) {
        return minus ? -n : n;
      } else {
        throw new NumberFormatException();
      }
      b = readByte();
    }
  }

  public int nextInt() {
    return (int) nextLong();
  }

  public long[] nextLongList(int n) {
    return nextLongTable(1, n)[0];
  }

  public int[] nextIntList(int n) {
    return nextIntTable(1, n)[0];
  }

  public long[][] nextLongTable(int n, int m) {
    long[][] ret = new long[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        ret[i][j] = nextLong();
      }
    }
    return ret;
  }

  public int[][] nextIntTable(int n, int m) {
    int[][] ret = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        ret[i][j] = nextInt();
      }
    }
    return ret;
  }
}