Массив. Выведите остановки самого длинного маршрута

b = []
for _ in range(int(input())):
    b.append(input())
r1 = b.index(input())
r2 = b.index(input())
r1, r2 = min(r1, r2), max(r1, r2)
print(*(b[r1:r2] if len(b[r1:r2]) > len(b[r2 + 1:] + b[:r1]) else b[r2 + 1:] + b[:r1]), sep='\n')

for _ in range(int(input())):

for _ in range(8):

n = int(input())
stops = [input() for _ in range(n)]
a, b = input(), input()
 
# Find the start and end indices of the blocked section
start_index = stops.index(a)
end_index = stops.index(b)
 
# Create the two possible routes
route1 = stops[start_index:end_index+1]
route2 = stops[end_index:] + stops[:start_index+1]
 
# Determine the longest route and print it
longest_route = route1 if len(route1) > len(route2) else route2
print("\n".join(longest_route))

n = int(input())
stops = [input() for i in range(n)]
start, end = input(), input()
 
route = stops[stops.index(start):] + stops[:stops.index(end)]
 
if start in stops[stops.index(end):]:
    route = stops[stops.index(end):stops.index(start)]
 
print(*route, sep='\n')

b = []
for i in range(int(input('Количество остановок: '))):
    b.append(input(f'Остановка {i + 1}'))
r1 = b.index(input('Первая перекрытая:'))
r2 = b.index(input('Вторая перекрытая:'))
r1, r2 = min(r1, r2), max(r1, r2)
print('Самый длинный маршрут:')
print(*(b[r1:r2] if len(b[r1:r2]) > len(b[r2 + 1:] + b[:r1]) else b[r2 + 1:] + b[:r1]), sep='\n')

n = int(input())
lst = [input() for _ in range(n)]
a, b = input(), input()
s1 = lst[lst.index(a)+1:lst.index(b)]
s2 = lst[lst.index(b)+1:]+lst[:lst.index(a)]
if len(s1)>len(s2):print(*s1,sep='\n')
if len(s2)>len(s1):print(*s2,sep='\n')