f = open('26.txt')

n = int(f.readline())

a=[]

for s in f:

start,end=map(int, s.split())

a.append([end, start])

a.sort()

count=[]

z=0

for i in range(n):

if z==0:

z=a[i][0]

count.append(a[i])

last=i

elif z<=a[i][1]:

z=a[i][0]

count.append(a[i])

last=i

z = count[-2][0]

maxi = count[-1][1] - count[-2][0]

for i in range(last + 1, n):

if z < a[i][1]:

count[-1] = a[i]

if count[-1][1] - count[-2][0] > maxi:

maxi = count[-1][1] - count[-2][0]

print(len(count), maxi)

data = open('26.txt').readlines()[1:]

times = []

for item in data:

time = [int(i) for i in item.split()]

times.append(time)

times.sort(key=lambda x: x[1])

selectedTimes = [times[0]]

for time in times[1:]:

if selectedTimes[-1][1] <= time[0]:

selectedTimes.append(time)

selectedLastElement = selectedTimes[-1]

endingOfThePreLast = selectedTimes[-2][1]

for time in times:

if time[0] > selectedLastElement[0]:

selectedLastElement = time

biggestGapBetweenTwoLastElements = selectedLastElement[0]-endingOfThePreLast

print(len(selectedTimes), biggestGapBetweenTwoLastElements)

f = open('26.txt')

f.readline()

a, b = [], []

n, k, max1 = 1, 0, 0

for i in f:

a.append(list(map(int,i.split())))

a.sort(key = lambda x: x[1]) # сор­ти­ру­ем по вре­ме­ни за­вер­ше­ния

b1, b0 = a[0][1], 0 # пра­вые гра­ни­цы по­след­них двух кон­фе­ренц­мй

for i in range(1, len(a)):

if a[i][0] >= b1: # усло­вие того, что кон­фе­рен­ции не пе­ре­се­ка­ют­ся

n += 1 # ко­ли­че­ство ко­фе­рен­ций

b0 = b1

b1 = a[i][1]

k = i # номер по­след­ней кон­фе­рен­ции

for i in range(k, len(a)):

if a[i][0] >= b0:

max1 = max(max1, a[i][0] - b0) # пы­та­ем­ся найти под­хо­дя­щую по­след­нюю кон­фе­рен­цию

print(n, max1)