Untitled

def find_two_min_odd_divisors(n):
    if n < 1:
        return "Input must be a positive integer."
    
    divisors = []
    odd = 3  # Start from the smallest odd number greater than 1
    
    while len(divisors) < 2:
        if n % odd == 0:
            divisors.append(odd)
        odd += 2  # Move to the next odd number
    
    return divisors

# Example usage
number = int(input("Enter a number: "))
result = find_two_min_odd_divisors(number)
print(f"The two smallest odd divisors greater than 1 of {number} are: {result}")