# your code goes here
def get_smallest_prime_factor(n):
    if n <= 1:
        return None  # 0 and 1 don't have prime factors
    
    # Check every number from 2 up to sqrt(n)
    i = 2
    while i * i <= n:
        if n % i == 0:
            return i  # First divisor found is the smallest prime factor
        i += 1
        
    return n  # If no divisor found, n itself is prime

# Example Usage:
num = 35
print(f"Smallest prime factor of {num} is {get_smallest_prime_factor(num)}")
# Output: 5