이렇게 코드를 작성했는데 이것도 맞는 답인가요?
n = int(input())
a_lst = []
b_lst = []
for i in range(n):
total = 0
a, b = map(int, input().split())
a_lst.append(a)
b_lst.append(b)
for j in range(0, len(b_lst)):
for k in range(0, len(a_lst)):
if b_lst[j] == a_lst[k]:
total += 1
largest = total
if total > largest:
total = largest
print(total)