Chef and his friends are playing the game AMONG US. They all have chosen their names as numbers. There are N people in Chef’s group including him, and each swears that he is not the imposter. However, it turns out there were N+1 people in the game. Now all that Chef needs to know is the name of the imposter, which is a number. Also remember that numbers can be duplicate. Can you help out Chef in finding the imposter?
Input : 
First line contains the value of N. Second line contains the N numbers that Chef’s friends used as their names. Third line contains the N+1 numbers that people in the game have used as their names.
Output : 
Print the extra number in new line.
Constraints : 
1 ≤ Numbers used as names ≤ 1,000
1 ≤ N ≤ 1,000,000
Sample Input : 
3
4 2 5
4 2 3 5
Sample Output : 
3

Starter code:

Solutions:
try:
	n=int(input())
	x=[*list(map(int, input().split()))]
	y=[*list(map(int, input().split()))]
	for i in y:
		d=x.count(i)-y.count(i)
		if d!=0:
			print(i)
			break
except: pass


n=int(input())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
p=1
l1=sorted(l1)
l2=sorted(l2)
for i in range(len(l1)):
    if l1[i]==l2[i]:
        continue 
    else:
        print(l2[i])
        p=0
        break
if p:
    print(l2[-1])
    


t = int(input())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))

#arr1.sort()
#arr2.sort()


print(sum(arr2)-sum(arr1))
          
#print(ans)               


n=int(input())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
p=1
l1=sorted(l1)
l2=sorted(l2)
for i in range(len(l1)):
    if l1[i]==l2[i]:
        continue 
    else:
        print(l2[i])
        p=0
        break
if p:
    print(l2[-1])
    


# cook your dish here




def main():
    N= int(input())
    Numbers = list(map(int,input().split()))
    NumbersG = list(map(int,input().split()))
    n1 = [0 for i in range(1001)]
    for i in NumbersG:
    	n1[i] +=1
    for i in Numbers:
    	n1[i] -=1
    for i in range(len(n1)):
    	if n1[i] != 0:
    		print(i)
    		break    	

def __starting_point():
	main()
# cook your dish here

__starting_point()

# cook your dish here




def main():
    N= int(input())
    Numbers = list(map(int,input().split()))
    NumbersG = list(map(int,input().split()))
    n1 = [0 for i in range(1001)]
    for i in NumbersG:
    	n1[i] +=1
    for i in Numbers:
    	n1[i] -=1
    for i in range(len(n1)):
    	if n1[i] != 0:
    		print(i)
    		break    	

def __starting_point():
	main()
# cook your dish here

__starting_point()

# cook your dish here
def amongus(n,f,d):
    for i in range(n):
        if f[i]!=d[i]:
            return d[i]
    return d[-1]
    
def __starting_point():
    n=int(input())
    f=list(map(int,input().strip().split()))
    d=list(map(int,input().strip().split()))
    f.sort()
    d.sort()
    print(amongus(n,f,d))

__starting_point()

# cook your dish
a=input()
b=sorted(input().split())
c=sorted(input().split())
f=0
for i in range(0,len(b)):
    if c[i]!=b[i]:
        print(c[i])
        f=1 
        break
if f==0:
    print(c[-1])

# cook your dish here
n=int(input())
arr=list(map(int,input().split()))
brr=list(map(int,input().split()))
print(sum(brr)-sum(arr))


n=int(input())
c=list(map(int, input().split()))
d=list(map(int, input().split()))
print(sum(d)-sum(c))

# cook your dish here
k = int(input())
act_name = list(map(int, input().split()))
imposter = list(map(int, input().split()))
names = [0 for i in range(1001)]
for num in act_name:
    names[num] += 1
for num in imposter:
    if(names[num] == 0):
        ans = num
    else:
        names[num] -= 1
print(ans)


# cook your dish here
from collections import Counter
n=int(input())

arr=[int(x) for x in input().split()]
arr2=[int(x) for x in input().split()]

print(sum(arr2)-sum(arr))



p = int(input())
l = list(map(int,input().split()))
m = list(map(int,input().split()))
b = sum(l)
c = sum(m)
print(abs(b-c))


n=int(input())
frnd=[int(x) for x in input().split()]
tot=[int(x) for x in input().split()]
frnd.sort()
tot.sort()
for i in range (n+1):
    if (i==n):
        print(tot[i])
    elif (frnd[i]!=tot[i]):
        print(tot[i])
        break

# cook your dish here
def solve():

    n=int(input())
    k=list(map(int,input().split()))
    h=list(map(int,input().split()))
    k.sort()
    h.sort()
    flag=0
    for i in range(n):
        if k[i] != h[i]:
            print(h[i])
            flag=1
            break
    if flag==0 :
        print(h[-1])
t = 1
for i in range(t):
    solve()

try:
    
    x=int(input())
    p=list(map(int,input().split()))
    q=list(map(int,input().split()))
    print(sum(q)-sum(p))
   
except EOFError:
    pass

# cook your dish here
n=int(input())
n_numbers=list(map(int,input().split()))
n1_numbers=list(map(int,input().split()))
sum1=0
sum2=0
sum3=0
for i in range(len(n_numbers)):
    sum1=sum1+n_numbers[i]
for j in range(len(n1_numbers)):
    sum2=sum2+n1_numbers[j]
sum3=sum2-sum1
print(sum3)


N = int(input())
list1 = list(map(int,input().split()))
list2 = list(map(int,input().split()))

for i in list2:
    if(list1.count(i)!=list2.count(i)):
        print(i)
        break

# cook your dish here
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
print(abs(sum(a)-sum(b)))


# cook your dish here
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x

def lcm(x, y):
    return (x*y)//(gcd(x,y))

def isPrime(n) : 
    if (n <= 1) : 
        return False
    if (n <= 3) : 
        return True
    if (n % 2 == 0 or n % 3 == 0) : 
        return False
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
    return True

abc="abcdefghijklmnopqrstuvwxyz"

pi=3.141592653589793238





n = int(input())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))

arr1.sort()
arr2.sort()
x = False
for i in range(n):
    if(arr1[i]!=arr2[i]):
        print(arr2[i])
        x = True
        break



if(not x):
    print(arr2[-1])








try:
    x=int(input())
    a=[*map(int, input().split())]
    b=[*map(int, input().split())]
    for i in b:
        y=a.count(i)-b.count(i)
        if y!=0:
            print(i)
            break
except: pass

from collections import Counter
#inputlist = list(input().split())
n = int(input())
list1 = list(map(int, input().split()))[:n]
list1 = sorted(list1)
list2 = list(map(int, input().split()))[:n+1]
list2 = sorted(list2)
cnt1 = Counter(list1)
cnt2 = Counter(list2)
print(*list((cnt2 - cnt1).elements()))

try:
	n=int(input())
	x=[*map(int, input().split())]
	y=[*map(int, input().split())]
	for i in y:
		d=x.count(i)-y.count(i)
		if d!=0:
			print(i)
			break
except: pass

from collections import Counter
n=int(input())
arr1=list(map(int,input().split()))[:n]
arr2=list(map(int,input().split()))[:n+1]
c1 = Counter(arr1)
# print(c1)
c2 = Counter(arr2)
# print(c2)
diff = list((c2 - c1).elements())
print(*diff)