def min_divisor_fast(N):
    d =  2
    while d * d <= N:
        if N % d == 0:
            return d
        d += 1
    return N