def findMax (tasks):
maxCount = []
maxTask = []
for i in range (len (tasks)):
    if maxTask == []: maxTask.append (tasks [i])
    else:
        count = 0
        for j in range (len (maxTask)):
            if tasks [i] == maxTask [j]: continue
            else:
                if (tasks [i][0] < maxTask [j][0] and tasks [i][1] <= maxTask [j][0]) or (tasks [i][0] >= maxTask [j][1] and tasks [i][1] > maxTask [j][0]): count += 1
                if count == len (maxTask): maxTask.append (tasks [i])
    maxCount.append (len (maxTask))
    maxTask = []
return max (maxCount)