#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

#define MOD 1000000007

bool isPrime(int num) {
    if (num < 2) return false;
    if (num == 2) return true;
    if (num % 2 == 0) return false;
    for (int i = 3; i * i <= num; i += 2) {
        if (num % i == 0) return false;
    }
    return true;
}

long long factorial(int num) {
    long long result = 1;
    for (int i = 1; i <= num; i++) {
        result = (result * i) % MOD;
    }
    return result;
}

int solution(int n) {
    // Count primes from 1 to n
    int primeCount = 0;
    for (int i = 1; i <= n; i++) {
        if (isPrime(i)) {
            primeCount++;
        }
    }
    
    // Count prime positions from 1 to n (same as prime count)
    int primePositions = primeCount;
    
    // They must be equal for valid arrangements
    if (primeCount != primePositions) {
        return 0;
    }
    
    int nonPrimeCount = n - primeCount;
    
    // Arrange primes in prime positions × non-primes in non-prime positions
    long long result = (factorial(primeCount) * factorial(nonPrimeCount)) % MOD;
    return result;
}

int main() {
    int n;
    scanf("%d", &n);
    
    int result = solution(n);
    printf("%d\n", result);
    
    return 0;
}