Submission #164400

#TimeUsernameProblemLanguageResultExecution timeMemory
164400boolodifjenulaUtrka (COCI14_utrka)Cpython 3
80 / 80
676 ms19872 KiB
n=int(input())
L=[]
L1=[]
for i in range (n):
    L+=[input()]
for i in range (n-1):
    L1+=[input()]
L.sort()
L1.sort()
x=0
for i in range(n-1):
    if L[i]!=L1[i]:
        x=L[i]
        break
if x: print(x)
else: print(L[-1])
    
#Verdict Execution timeMemoryGrader output
Fetching results...