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

#define MOD 1000000007
#define MAX_PARTITIONS 10000

int partitions[MAX_PARTITIONS][100];
int partitionSizes[MAX_PARTITIONS];
int numPartitions;

void generatePartitions(int n, int maxVal, int current[], int currentSize, int index) {
    if (n == 0) {
        for (int i = 0; i < currentSize; i++) {
            partitions[numPartitions][i] = current[i];
        }
        partitionSizes[numPartitions] = currentSize;
        numPartitions++;
        return;
    }
    
    for (int i = 1; i <= (n < maxVal ? n : maxVal); i++) {
        current[currentSize] = i;
        generatePartitions(n - i, i, current, currentSize + 1, index + 1);
    }
}

long long countNiceDivisors(int partition[], int size) {
    long long result = 1;
    for (int i = 0; i < size; i++) {
        result = (result * partition[i]) % MOD;
    }
    return result;
}

int solution(int primeFactors) {
    numPartitions = 0;
    int current[100];
    generatePartitions(primeFactors, primeFactors, current, 0, 0);
    
    long long maxDivisors = 0;
    for (int i = 0; i < numPartitions; i++) {
        long long divisors = countNiceDivisors(partitions[i], partitionSizes[i]);
        if (divisors > maxDivisors) {
            maxDivisors = divisors;
        }
    }
    
    return (int) maxDivisors;
}

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