MOD = 10**9 + 7

M = int(input())

if M == 1:
    print(1)
else:
    result = 1
    # Factorize M into its prime factors
    m = M
    i = 2
    while i * i <= m:
        if m % i == 0:
            exponent = 0
            while m % i == 0:
                exponent += 1
                m //= i
            # Multiply the result by i^(exponent^2)
            result = (result * pow(i, exponent * exponent, MOD)) % MOD
        i += 1
    # Check if a prime factor remains
    if m > 1:
        # Multiply by m^(1^2)
        result = (result * pow(m, 1, MOD)) % MOD  # pow(m, 1) is m
    print(result)