Problem:
 Score : 100 points    Problem Statement You are given three integers, A , B and C . Among them, two are the same, but the remaining one is different from the rest. For example, when A=5,B=7,C=5 , A and C are the same, but B is different. Find the one that is different from the rest among the given three integers.      Constraints  -100 \leq A,B,C \leq 100   A , B and C are integers.  The input satisfies the condition in the statement.         Input Input is given from Standard Input in the following format:  A  B  C       Output Among A , B and C , print the integer that is different from the rest.        Sample Input 1 5 7 5      Sample Output 1 7  This is the same case as the one in the statement.       Sample Input 2 1 1 7      Sample Output 2 7  In this case, C is the one we seek.       Sample Input 3 -100 100 100      Sample Output 3 -100

Solution (Python):

A, B, C = map(int, input().split())

if A == B :
    print(C)
elif B == C :
    print(A)
elif C == A :
    print(B)

Solution (Python):
a, b, c = map(int, input().split())
if a == b:
  print(c)
elif b == c:
  print(a)
elif c == a:
  print(b)

Solution (Python):
a,b,c=map(int,input().split())
print(c if a==b else b if a==c else a)

Solution (Python):
a,b,c = map(int,input().split())
if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Solution (Python):
def resolve():
	a, b, c = map(int, input().split())
	if a == b:
		print(c)
	elif a == c:
		print(b)
	else:
		print(a)
resolve()

Solution (Python):
a,b,c=map(int,input().split())
if b==c:
    print(a)
elif a==c:
    print(b)
else:
    print(c)

Solution (Python):
array = input().split()
for _ in array:
  if array.count(_) == 1:
    print(_)
    break

Solution (Python):
a, b, c = map(int, input().split())
if a == b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Solution (Python):


A, B, C = map(int, input().split())

if A == B:
    print(C)
elif B == C:
    print(A)
else:
    print(B)

Solution (Python):
a, b, c = map(int, input().split())
if a == b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Solution (Python):
A, B, C = map(int, input().split())
print(C if A==B else A if B==C else B)

Solution (Python):
A,B,C = map(int,input().split())
if A ==B:
    print(C)
elif B ==C:
    print(A)
elif C == A:
    print(B)

Solution (Python):
a=list(map(int,input().split()))
for i in a:
    if a.count(i)==1:
        ans=int(i)
print(ans)

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

a,b,c = map(int,input().split())
if a == b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Solution (Python):
a,b,c = map(int, input().split())

if a ==  b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Solution (Python):
A, B, C = map(int, input().split())

if A == B:
    print(C)
elif B == C:
    print(A)
else:
    print(B)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()

if A == B:
	print(C)
elif A == C:
	print(B)
else:
	print(A)

Solution (Python):
A,B,C = map(int,input().split())

if A==B:
  print(C)
elif A==C:
  print(B)
else:
  print(A)

Solution (Python):
a,b,c=map(int,input().split())
if a==b:
  print(c)
elif a==c:
  print(b)
else:
  print(a)

Solution (Python):
a, b, c = map(int, input().split())
if a-b == 0:
  print(c)
elif a-c == 0:
  print(b)
else:
  print(a)

Solution (Python):
a,b,c = map(int,input().split())

if a == b:
  print(c)
elif a == c:
  print(b)
else:
  print(a)

Solution (Python):
a=[int(i) for i in input().split()]
for i in range(3):
    if a.count(a[i])==1:
        print(a[i])

Solution (Python):
abclist=list(map(int,input().split()))
abclist.sort()

A,B,C=abclist
if A==B:
  print(C)
else:
  print(A)

Solution (Python):
abc = list(map(int, input().split()))
abc.sort()

if abc[0]!=abc[1]:
  print(abc[0])
else:
  print(abc[2])

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

a,b,c=MI()
if a==b:
    print(c)
elif b==c:
    print(a)
elif c==a:
    print(b)

Solution (Python):
a,b,c=map(int,input().split())
if a==b:
  print(c)
elif b==c:
  print(a)
else:
  print(b)

Solution (Python):
A,B,C = map(int,input().split())
if A == B:
  print(C)
elif B == C:
  print(A)
else:
  print(B)

Solution (Python):
a, b, c = map(int, input().split())
if a == b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Solution (Python):
a,b,c=map(int,input().split())
print(a if b==c else b if a==c else c)

Solution (Python):
x = input().split()
t = ''
if x[0] == x[1]:
  t = x[0]
elif x[1] == x[2]:
  t = x[1]
elif x[0] == x[2]:
  t = x[0]
for i in x:
  if t != i:
    print(i)

Solution (Python):
a,b,c=map(int,input().split())
print(a if b==c else b if a==c else c)

Solution (Python):
a = [int(_) for _ in input().split()]
for i in a:
    if a.count(i) == 1:
        print(i)

Solution (Python):
a = [int(_) for _ in input().split()]
for i in range(len(a)):
    if a.count(a[i]) == 1:
        print(a[i])

Solution (Python):
a,b,c = map(int,input().split())
if a == b:
  print(c)
elif b == c:
  print(a)
else:
  print(b)

Solution (Python):
s=list(map(int,input().split()))
if s[0]==s[1]:
  a=2
elif s[1]==s[2]:
  a=0
else:
  a=1
print(s[a])

Solution (Python):
a,b,c=map(int,input().split())
if a==b:
  print(c)
elif b==c:
  print(a)
else:
  print(b)

Solution (Python):
a, b, c = map(int, input().split())
if a == b:
  print(c)
elif b == c:
  print(a)
else:
  print(b)

Solution (Python):
a,b,c=map(int,input().split())
if a==b:
    print(c)
elif b==c:
    print(a)
else:
    print(b)

Solution (Python):
a,b,c = map(int, input().split())
print(a if b==c else b if a==c else c)

Solution (Python):


a, b, c = map(int, input().split())
if a == b:
    print(c)
elif a == c:
    print(b)
elif b == c:
    print(a)

Solution (Python):
s=list(map(int,input().split()))

for i in s:
    if s.count(i)!=2:
        print(i)
    else:
        pass

Solution (Python):
_list = input().split()
for i in _list:
    if _list.count(i) == 1:
        print(i)
        exit

Solution (Python):
A, B, C = map(int, input().split())
if A == B:
  print(C)
elif B == C:
  print(A)
else:
  print(B)

Solution (Python):
a,b,c = map(int, input().split())
if a==b:
    print(c)
elif b==c:
    print(a)
else:
    print(b)

Solution (Python):
a, b, c = list(map(int, input().split()))
if a == b:
    print(c)
elif b == c:
    print(a)
elif c == a:
    print(b)

Solution (Python):
a,b,c = map(int, input().split())
if a==b:
  print(c)
elif a==c:
  print(b)
else:
  print(a)

Solution (Python):
args = input().split()
a = int(args[0])
b = int(args[1])
c = int(args[2])

if a == b:
  print(c)
elif a == c:
  print(b)
else:
  print(a)

Solution (Python):
args = input().split()
a = int(args[0])
b = int(args[1])
c = int(args[2])

if a == b:
  print(c)
elif a == c:
  print(b)
else:
  print(a)

Solution (Python):
from collections import Counter
li = map(int, input().split())
cnts = Counter(li).most_common()
print(cnts[-1][0])

Solution (Python):
A, B, C = map(int, input().split())
if A == B:
  print(C)
elif A == C:
  print(B)
else:
  print(A)

Solution (Python):
import sys
input = sys.stdin.readline

def main():
  A,B,C = map(int, input().split())
  if A==B:
    print(C)
  elif B==C:
    print(A)
  else:
    print(B)

if __name__ == "__main__":
  main()

Solution (Python):
a,b,c=map(int,input().split())
if a==b:
    print(c)
elif b==c:
    print(a)
else:
    print(b)

Solution (Python):
a,b,c=map(int,input().split())
if a==c:
  print(b)
elif b==c:
  print(a)
elif a==b:
  print(c)

Solution (Python):
a,b,c = map(int,input().split())
if a == b:
  print(c)
elif a == c:
  print(b)
else:
  print(a)

Solution (Python):
a,b,c=[str(i)for i in input().split()]
if a==b:
  print(c)
elif b==c:
  print(a)
else:
  print(b)

Solution (Python):
A,B,C = map(int, input().split())
ans = A if B == C else B if A == C else C 
print(ans)

Solution (Python):
A,B,C = map(int, input().split())
ans = 0
if A == B:
    ans = C
elif B == C:
    ans = A
else:
    ans = B

print(ans)

Solution (Python):
A,B,C = map(int,input().split())
if A == B:
    print(C)
elif B == C:
    print(A)
else:
    print(B)

Solution (Python):
a, b, c = map(int, input().split())

ans = a if b == c else b if c == a else c
print(ans)

Solution (Python):
a, b, c = map (int, input (). split ())
if a == b:
    print (c)

elif b == c:
    print (a)

else:
    print (b)

Solution (Python):
a, b, c = map(int, input().split())
if a == b:
    print(c)

elif b == c:
    print(a)

else:
    print(b)

Solution (Python):

def resolve():
    A, B, C = list(map(int,input().split()))
    if A == B:
        print(C)
    if B == C:
        print(A)
    if C == A:
        print(B)


if '__main__' == __name__:
    resolve()

Solution (Python):
a,b,c  = input().split()
if a not in (b,c):
  print(a)
elif b not in (a,c):
  print(b)
else:
  print(c)

Solution (Python):
a,b,c = input().split()
if a == b:
	print(c)
elif a == c :
    print(b)
else:
    print(a)

Solution (Python):
def resolve():
    a,b,c=map(int,input().split())
    if a==b:
        print(c)
    elif a==c:
        print(b)
    else:
        print(a)
resolve()

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():

    l=list(map(int,input().split()))
    for i in l:
        if l.count(i)==1:
            print(i)
            break
resolve()

Solution (Python):
L1 = list(map(int,input().split()))
L2 = list(set(L1))
print(2 * sum(L2) - sum(L1))

Solution (Python):
a,b,c=map(int,input().split())
if a==b:
    print(c)
elif a==c:
    print(b)
elif b==c:
    print(a)

Solution (Python):
a, b, c = map(int, input().split())

if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Solution (Python):
a,b,c = map(int,input().split())
if a == c:
    print(b)
elif a == b:
    print(c)
else:
    print(a)

Solution (Python):
ls = list(map(int,input().split()))
if ls[1] != ls[2] and ls[2] == ls[0]:
  print(ls[1])
if ls[0] != ls[1] and ls[1] == ls[2]:
  print(ls[0])
if ls[2] != ls[1] and ls[1] == ls[0]:
  print(ls[2])

Solution (Python):
A, B, C = map(int, input().split())
if A == B:
  print(C)
elif A == C:
  print(B)
else:
  print(A)

Solution (Python):
s = list(map(int, input().split()))
for i in s:
  if s.count(i)==1:
      print(i)

Solution (Python):
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    H = il()
    print(H[0] ^ H[1] ^ H[2])



if __name__ == '__main__':
    main()

Solution (Python):
x=sorted(map(int,input().split()))
print(x[2] if x[0]==x[1] else x[0])

Solution (Python):
a,b,c=map(int, input().split())
if (a==b): print(c)
if (b==c): print(a)
if (c==a): print(b)

Solution (Python):
a, b, c = map(int,input().split())

if a==b:
  print(c)
if b==c:
  print(a)
if a==c:
  print(b)

Solution (Python):
a,b,c = map(int,input().split())
ans = 0

if a == b:
    ans = c
else:
    if a == c:
        ans = b
    else:
        ans = a

print(ans)

Solution (Python):
A, B, C = map(int, input().split())
print(A if B == C else B if A == C else C)

Solution (Python):
a,b,c = input().split()

print(a if b==c else b if a==c else c)

Solution (Python):
a, b, c = map(int, input().split())

if a==b:
  print(c)
elif b==c:
  print(a)
else:
  print(b)

Solution (Python):
a, b, c = map(int, input().split())

if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Solution (Python):
a,b,c = list(map(int,input().split()))
if a != b and a!=c:
    print(a)
elif a!=b and b!=c:
    print(b)
else:
    print(c)

Solution (Python):
a = sorted(list(map(int, input().split())))
if a[1] == a[0]:
    print(a[2])
elif a[1] == a[2]:
    print(a[0])

Solution (Python):
a,b,c=map(int,input().split())
if(a!=b and a!=c):
  print(a)
elif(b!=c and b!=a):
  print(b)
else:
  print(c)

Solution (Python):
A, B, C = map(int, input().split())

if A == B:
  print(C)
elif A == C:
  print(B)
else:
  print(A)

Solution (Python):
A,B,C = map(int,input().split())

print(A if B==C else B if A==C else C)

Solution (Python):
li = sorted(map(int,input().split()))
           
if li[0] == li[1]:
  print(li[2])
        
else:
        print(li[0])

Solution (Python):
a,b,c =list(map(int,input().split()))
if b == c:
    print(a)
elif c == a:
    print(b)
else:
    print(c)

Solution (Python):
l = list(map(int, input().split()))
l.sort()

if l[0]==l[1]:
  print(l[2])
else:
  print(l[0])

Solution (Python):
abc=input().split()
if abc[0] != abc[1]:
    if abc[0]!= abc[2]:
        print(abc[0])
    else:
        print(abc[1])
else:
    print(abc[2])

Solution (Python):
x=list(map(int,input().split()))
x.sort()
if x[0]==x[1]:
    print(x[2])
else:
    print(x[0])

Solution (Python):
a=list(map(int,input().split()))
print(sum(a)-2*(sum(a)-max(a)-min(a)))

Solution (Python):
A, B, C = map(int, input().split())

if A == B:
  print(C)
elif A == C:
  print(B)
else:
  print(A)

Solution (Python):
a,b,c =map(int,input().split())
if a==b :
  print(c)
elif a==c:
  print(b)
else :
  print(a)

Solution (Python):
icase=0    
if icase==0:
    a,b,c=map(int,input().split())
    if a==b:
        print(c)
    elif b==c:
        print(a)
    else:
        print(b)

Solution (Python):
L = sorted(map(int,input().split()))
if L[0]==L[1]:
  print(L[2])
else:
  print(L[0])

Solution (Python):
A,B,C=map(int,input().split())
print(A if B==C else B if A==C else C)

Solution (Python):


abc = list(map(int, input().split()))

a = abc[0]
b = abc[1]
c = abc[2]

if a == b:
    result = c
elif a == c:
    result = b
elif b == c:
    result = a

print(result)

Solution (Python):
def main():
    a, b, c = map(int, input().split())
    
    if a == b:
        print(c)
    elif a == c:
        print(b)
    else:
        print(a)
main()

Solution (Python):
a=list(map(int,input().split()))
for i in range(len(a)):
    if a.count(a[i])==1:
        print(a[i])

Solution (Python):
a, b, c = map(int, input().split())

if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Solution (Python):
A,B,C = map(int,input().split())

if A == B:
    print(C)
elif B == C:
    print(A)
elif C == A:
    print(B)

Solution (Python):
a,b,c = map(int, input().split())
if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Solution (Python):
a,b,c = map(int,input().split())
if(a == b):
    print(c)
elif(a == c):
    print(b)
elif(b == c):
    print(a)

Solution (Python):

A, B, C = map(int, input().split())
if A == B:
    print(C)
elif B == C:
    print(A)
else:
    print(B)

Solution (Python):
a,b,c=map(int,input().split())
print(a if b==c else b if a==c else c)

Solution (Python):
A, B, C = map(int, input().split())
print(A if B == C else B if A == C else C)

Solution (Python):
A,B,C = map(int,input().split())

if A==B and B!=C:
  print(C)
elif A!=B and B==C:
  print(A)
else:
  print(B)

Solution (Python):
A,B,C = map(int,input().split())

if A==B and B!=C:
  print(C)
elif A!=B and B==C:
  print(A)
else:
  print(B)

Solution (Python):
A,B,C = map(int,input().split())

if A==B and B!=C:
  print(C)
elif A!=B and B==C:
  print(A)
else:
  print(B)

Solution (Python):
a,b,c=map(int,input().split())
print(a if b==c else b if a==c else c)

Solution (Python):
a, b, c = map(int, input().split())

if a == b:
    print(c)
elif a == c:
    print(b)
elif b == c:
    print(a)

Solution (Python):
n,m,k=map(int,input().split())
if n==m:print(k)
elif n==k:print(m)
else:print(n)

Solution (Python):
a, b, c = map(int, input().split())
if a==b:
    print(c)
elif b==c:
    print(a)
else:
    print(b)

Solution (Python):
a,b,c=input().split()
if a==b:
  print(c)
elif a==c:
  print(b)
else:
  print(a)

Solution (Python):
a, b, c = map(int, input().split())
if a == b:
    print(c)
elif a == c:
    print(b)
elif b == c:
    print(a)

Solution (Python):
a, b, c = sorted(map(int,input().split()))
print(c if a==b else a)

Solution (Python):
A, B, C = map(int, input().split())
if (A == C):
    print(B)
elif (A == B):
    print(C)
else:
    print(A)

Solution (Python):
A, B, C = map(int, input().split())

if A == B:
    print(C)
elif A == C:
    print(B)
else:
    print(A)

Solution (Python):
a,b,c = map(int, input().split())

if a==b:
  print(c)
elif b==c:
  print(a)
else:
  print(b)

Solution (Python):
a, b, c = map(int, input().split())
if a == b:
  print(c)
elif a == c:
  print(b)
else:
  print(a)

Solution (Python):
a,b,c=sorted(list(map(int,input().split())))
if b==a: print(c)
else:print(a)

Solution (Python):
a,b,c = map(int,input().split())
if a == b:
  print(c)
elif b == c:
  print(a)
else:
  print(b)

Solution (Python):
A, B, C = map(int, input().split())
print(C if A == B else B if A == C else A)

Solution (Python):
a=[int(i) for i in input().split()]

a.sort()

if a[0]==a[1]:
    print(a[2])
else:
    print(a[0])

Solution (Python):
n = list(map(int,input().split()))
dummy = set(n)
print(sum(dummy)-(sum(n)-sum(dummy)))

Solution (Python):
A, B, C = map(int, input().split())
print(A if B==C else B if A==C else C)

Solution (Python):
A = [int(x) for x in input().split()]
B = sorted(A)
if B[0] == B[1]:
    print(B[2])
else:
    print(B[0])

Solution (Python):
a, b, c = map(int, input().strip().split())

if a == b:
    print(c)
elif a == c:
    print(b)
elif b == c:
    print(a)

Solution (Python):
A,B,C=map(int,input().split())
if A==B:
    print(C)
elif A==C:
    print(B)
else:
    print(A)

Solution (Python):
a,b,c=map(int,input().split())
if a==b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Solution (Python):
a,b,c = map(int,input().split())
if a == b:
  print(c)
elif b == c:
  print(a)
else:
  print(b)

Solution (Python):
A, B, C = map(int, input().split())
lst=[A,B,C]
for val in lst:
    if lst.count(val)==1:
        print(val)

Solution (Python):
A, B, C = map(int, input().split())
if A==B:
  print(C)
elif A==C:
  print(B)
elif B==C:
  print(A)

Solution (Python):
a,b,c=map(int,input().split())
print(a^b^c)

Solution (Python):
a,b,c = map(int, input().split())
if a == b:
  print(c)
elif b == c:
  print(a)
else:
  print(b)

Solution (Python):

A, B, C = map(int, input().split())
if A == B:
    print(C)
elif B == C:
    print(A)
else:
    print(B)

Solution (Python):
from collections import Counter
print(Counter(list(map(int,input().split()))).most_common()[-1][0])

Solution (Python):
from collections import Counter
a = Counter(list(map(int,input().split()))).most_common()
print(a[1][0])

Solution (Python):
X = list(map(int, input().split()))

f = max(X)
g = min(X)

if X.count(f) < X.count(g):
    print(f)
else:
    print(g)

Solution (Python):
a,b,c = map(int,input().split())
if a==b :print(c)
if a==c :print(b)
if b==c :print(a)

Solution (Python):
a,b,c=map(int,input().split())
if a==b:
  print(c)
elif b==c:
  print(a)
else:
  print(b)

Solution (Python):
A,B,C = map(int,input().split())

if A == B:
	answer = C
elif B == C:
	answer = A
else:
	answer = B

print(answer)

Solution (Python):

a,b,c = map(int,input().split())

if a == b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Solution (Python):
n = list(map(int,input().split()))
s = list(set(n))
a = n.count(s[0])
if a == 1:
    print(s[0])
else:
    print(s[1])

Solution (Python):
import sys

a, b, c = map(int, sys.stdin.readline().split())

def main():
    if a == b: ans = c
    elif b == c: ans = a
    else: ans = b
    print(ans)

if __name__ ==  '__main__':
    main()

Solution (Python):

numbers = [int(s) for s in input().split()]
if numbers.count(numbers[0]) == 1:
    print(numbers[0])
elif numbers.count(numbers[1]) == 1:
    print(numbers[1])
else:
    print(numbers[2])

Solution (Python):
a,b,c= map(int, input().split())


if a == b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Solution (Python):
A, B, C = map(int, input().split())
print(C if A == B else A if B == C else B)

Solution (Python):
A, B, C = map(int, input().split())
if A == B:
    print(C)
elif B == C:
    print(A)
else:
    print(B)

Solution (Python):
a,b,c = map(int,input().split())
if a == b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
a,b,c = iim()

if a == b:
    print(c)
else:
    if a == c:
        print(b)
    else:
        print(a)

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    b = []

    for i in a:
        if i in b:
            b.remove(i)
        else:
            b.append(i)
    print(b[0])

Solution (Python):
a,b,c = map(int, input().split())
print(a^b^c)

Solution (Python):
a, b, c = map(int, input().split())
if a == b: print(c)
if b == c: print(a)
if c == a: print(b)

Solution (Python):
a,b,c=map(int,input().split())
print(a if b==c else b if a==c else c)

Solution (Python):
import math
import string
import collections
from collections import Counter


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

a, b, c = map(int, input().split())
if a == b:
    print(c)
if b == c:
    print(a)
if a == c:
    print(b)

Solution (Python):
li = list(map(int,input().split()))
li.sort()

if li[0] == li[1]:
    print(li[2])
else:
    print(li[0])

Solution (Python):
a,b,c = map(int,input().split())
if a==b:ans=c
elif a==c:ans=b
else:ans=a
print(ans)

Solution (Python):
import statistics
A = list(map(int, input().split()))
B = statistics.mode(A)
[print(i) for i in A if i != B]

Solution (Python):
import sys
from math import sqrt
from collections import Counter

input = sys.stdin.readline


def I():
    return int(input())


def MI():
    return map(int, input().split())


def LI():
    return list(MI())


def LIN(n: int):
    return [I() for _ in range(n)]


inf = float("inf")
mod = 10 ** 9 + 7


def main():
    a, b, c = MI()

    if a == b:
        print(c)
    elif a == c:
        print(b)
    else:
        print(a)

    pass


if __name__ == "__main__":
    main()

Solution (Python):
A,B,C=input().split();print(A*(B==C)or B*(A==C)or C)

Solution (Python):
a,b,c=map(int,input().split())
if a==b:print(c)
elif b==c:print(a)
else:print(b)

Solution (Python):
A, B, C = map(int,input().split())

if A == B:
  print(C)
elif B == C:
  print(A)
else:
  print(B)

Solution (Python):
ABC = list(map(int, input().split()))
for t in ABC:
    if ABC.count(t) == 1:
        print(t)

Solution (Python):
a,b,c = map(int,input().split())
if a == c:
    print(b)
if a == b:
    print(c)
if b == c:
    print(a)

Solution (Python):
A,B,C=map(int,input().split())
if A==B:
  print(C)
elif B==C:
  print(A)
else:
  print(B)

Solution (Python):
A,B,C = map(int,input().split())
if A==B:
    print(C)
elif B==C:
    print(A)
else:
    print(B)

Solution (Python):

import sys


def solve(A: int, B: int, C: int):
    print(A ^ B ^ C)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    C = int(next(tokens))  
    solve(A, B, C)


if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter
l = [int(i) for i in input().split()]
c = dict(Counter(l))
for k, v in c.items():
    if v == 1:
        print(k)

Solution (Python):
A,B,C=map(int,input().split())

print(A if B==C else B if A==C else C)

Solution (Python):
import sys
import os

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B, C = list(map(int, sys.stdin.buffer.readline().decode().split()))
    print(C if A == B else A if B == C else B)


if __name__ == '__main__':
    main()

Solution (Python):
A,B,C = map(int,input().split())

if A==B:
  print(C)
elif A==C:
  print(B)
else:
  print(A)

Solution (Python):
a, b, c = map(int, input().split())
if (a == b):
    print(c)
elif (b == c):
    print(a)
else:
    print(b)

Solution (Python):
a,b,c=map(int, input().split())
if a==b:
  print(c)
elif b==c:
  print(a)
else:
  print(b)

Solution (Python):
A, B, C = map(int,input().split())
if A == B: print(C)
elif B == C:print(A)
else: print(B)

Solution (Python):
import math

A,B,C=list(map(int, input().split()))

if A==B:
    print(C)
elif B==C:
    print(A)
else:
    print(B)

Solution (Python):
a,b,c=map(int,input().split())

if a==b:
    print(c)
elif a==c:
    print(b)
else:
    print(a)

Solution (Python):
A, B, C = map(int, input().split())
print(A if B == C else B if A == C else C)

Solution (Python):
a, b, c = map(int, input().split())
if a==b:print(c)
elif b==c:print(a)
else: print(b)

Solution (Python):
a,b,c=map(int,input().split())

if a==b:
  print(c)
elif b==c:
  print(a)
else:
  print(b)

Solution (Python):
a, b, c = map(int, input().split())

if a == b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Solution (Python):
a,b,c = map(int, input().split())
if(a == b):
    print(c)
elif(a == c):
    print(b)
else:
    print(a)

Solution (Python):
a,b,c=(map(int,input().split()))
if a==b:
  print(c)
elif a==c:
  print(b)
else:
  print(a)

Solution (Python):
a, b, c = map(int, input().split())
print(b if a==c else c if a==b else a)

Solution (Python):
l = input().split(' ')
if l[0] == l[1]:
  print(l[2])
elif l[0] == l[2]:
  print(l[1])
else:
  print(l[0])

Solution (Python):
a = list(map(int,input().split()))
a.sort()
print(a[0]*a[2]//a[1])

Solution (Python):
arr = list(map(int,input().split()))
arr.sort()
if arr[0]==arr[1]:
  print(arr[2])
else:
  print(arr[0])

Solution (Python):
arr = list(map(int,input().split()))
if arr[0]==arr[1]:
  print(arr[2])
elif arr[1]==arr[2]:
  print(arr[0])
else:
  print(arr[1])

Solution (Python):
d = {}
for i in input().split():
    if d.get(i) is None:
        d[i] = 0
    d[i] += 1
for k, v in d.items():
    if v == 1:
        print(k)
        exit()

Solution (Python):
a,b,c = [int(x) for x in input().split()]

if a == b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Solution (Python):
a, b, c = [int(i) for i in input().split()]

if a == b:
  print(c)
elif b == c:
  print(a)
else:
  print(b)

Solution (Python):
a,b,c=map(int,input().split())

if a==b:
    print(c)
elif b==c:
    print(a)
else:
    print(b)

Solution (Python):
A,B,C=map(int,input().split())
print(A if B==C else B if A==C else C)

Solution (Python):
A, B, C = map(int, input().split())

if A == B:
  print(C)
elif B == C:
  print(A)
elif C == A:
  print(B)

Solution (Python):


import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

from collections import Counter

a = na()
c = Counter(a)
print(c.most_common()[-1][0])

Solution (Python):

a,b,c=map(int,input().split())
if a==b:
    print(c)
elif a==c:
    print(b)
else:
    print(a)

Solution (Python):
a,b,c=map(int,input().split())
if a==b:
    print(c)
elif a==c:
    print(b)
else:
    print(a)

Solution (Python):
a,b,c = list(map(int,input().split()))

if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Solution (Python):
A,B,C=map(int,input().split())

if A==B :
    print(C)
elif B==C :
  print(A)
else :
   print(B)

Solution (Python):

A,B,C=map(int,input().split())

if A==B :
    print(C)

else :
    if B==C :
        print(A)
    else :
        print(B)

Solution (Python):
a, b, c = map(int, input().split())

if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Solution (Python):
a, b, c = map(int, input().split())

if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Solution (Python):
a,b,c=map(int,input().split())
if a==c:
    print(b)
elif b==c:
    print(a)
else:
    print(c)

Solution (Python):
A,B,C=map(int,input().split())
if A==B:
    print(C)
elif B==C:
    print(A)
else:
    print(B)

Solution (Python):
a,b,c=map(int,input().split())

if (a==b):
    print(c)
elif (a==c):
    print(b)
else:
    print(a)

Solution (Python):
a,b,c = map(int,input().split())
if a==b:
  print(c)
elif b==c:
  print(a)
else:
  print(b)

Solution (Python):
A,B,C = list(map(int,input().split()))

if A==B:
  print(C)
if A==C:
  print(B)
if B==C:
  print(A)

Solution (Python):

a,b,c=list(map(int,input().split()))

if (a==b):
    print(c)
elif (b==c):
    print(a)
else:
    print(b)

Solution (Python):
a,b,c=map(int,input().split())
print(a if b==c else b if a==c else c)

Solution (Python):
V = list(map(int, input().split()))
if V[0] == V[1]:
    print(V[2])
elif V[0] == V[2]:
    print(V[1])
else:
    print(V[0])

Solution (Python):
A, B, C = [int(i) for i in input().split()]

if A == B:
    print(C)
elif A == C:
    print(B)
else :
    print(A)

Solution (Python):
a,b,c = map(int,input().split())

if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Solution (Python):
a, b, c = map(int, input().split())
if a == b:
    print(c)
elif a == c:
    print(b)
elif b == c:
    print(a)

Solution (Python):
print(eval(input().replace(" ", "^")))