N = int(input())
Be = [0] * (100001)
Ki = [0] * (100001)
maxT = 0
for _ in range(N):
    A,B = map(int,input().split())
    Be[A] += 1
    Ki[B] += 1
    if B > maxT:
        maxT = B
if N % 2 == 0:
    F = N // 2
else:
    F = N // 2 + 1
jelen = 0
Be = Be[:maxT+1]
Ki = Ki[:maxT+1]
minTav = maxT
for i in range(maxT):
    jelen += Be[i]
    if jelen >= F and Be[i] > 0:
        if Be[i] + Ki[i]>= F:
            minTav = 1
            minPar = [i,i]
            break
        else:
            vissza = Be[i] +Ki[i]
            j = i-1
            while vissza < F:
                vissza += (Ki[j] + Be[j])
                j -= 1
            j = j + 1
            if i-j < minTav:
                minTav = i - j
                minPar = [j,i]
print(minTav+1)
print(*minPar)