def find_Divisor(x, y):
    start = min(x, y)
    end = max(x, y)

    if start <= 0:
        start = 1

    if start > end:
        return None

    best_divisor = 1
    best_count = 0

    for divisor in range(1, end + 1):
        count = end // divisor - (start - 1) // divisor
        if count > best_count:
            best_count = count
            best_divisor = divisor

    return best_divisor