25

div_first=0
div_second=0
def devisiors(i):
    count = 0
    step = 0
    for j in range(1, int(i ** 0.5)):
        if i % j == 0:
            count += 1
            if step == 0:
                global div_first
                div_first = i // j
            if step == 1:
                global div_second
                div_second = i // j
        step += 1
    count *= 2
    return count
max_divs = 0
div_f=0
div_s=0
for i in range(286564, 287270 + 1):
    val = devisiors(i)
    if max_divs <= val:
        max_divs = val
        div_f=div_first
        div_s=div_second
print(max_divs, div_f, div_s)