def find_Divisor(x, y):
    if x > y:
        x, y = y, x
    n = y - x + 1
    if n <= 0:
        return 0

    counts = [0] * (y + 1)

    for d in range(1, y + 1):
        first = ((x + d - 1) // d) * d
        if first > y:
            continue
        counts[d] = ((y - first) // d) + 1

    max_count = -1
    result = 1
    for d in range(1, y + 1):
        if counts[d] > max_count:
            max_count = counts[d]
            result = d
    return result