def prime_factors_count(num):
    factors_count = 0
    factor = 2
    while factor * factor <= num:
        while (num % factor) == 0:
            if num == 0:
                break
            num //= factor
            factors_count += 1
        factor += 1
    if num > 1:
        factors_count += 1
    return factors_count

def find_number_with_most_factors(n):
    max_factors = 0
    result = 0
    for i in range(1, n + 1):
        count = prime_factors_count(i)
        if count > max_factors:
            max_factors = count
            result = i
    return result
n = int(input().strip())
result = find_number_with_most_factors(n)
print(result)