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)
else:
    if 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())
if a==b:
    print(c)
elif a==c:
    print(b)
else:
    print(a)

Solution (Python):
L = sorted(list(input().split()))
if L[0] == L[1]:
  print(L[2])
if L[1] == L[2]:
  print(L[0])

Solution (Python):
L = sorted(list(input().split()))
if L[0] == L[1]:
  print(L[2])
if L[1] == L[2]:
  print(L[0])

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

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

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

Solution (Python):
""" AtCoder """

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=map(int,input().split())
if a==b:
    print(c)
elif a==c:
    print(b)
else:
    print(a)

Solution (Python):
from collections import Counter
A = Counter([int(i) for i in input().split()]).most_common()
print(A[1][0])

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 = list(map(int,input().split()))
a.sort()

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

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):
from collections import Counter
cnt = Counter(list(map(int, input().split())))
print(cnt.most_common()[1][0])

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

if ([a,b,c].count(a) == 1) :
	print(a)
elif ([a,b,c].count(b) == 1) :
	print(b)
else :
	print(c)

Solution (Python):


import sys


INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


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

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())
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):
a,b,c = map(int,input().split())

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

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

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):
print(eval(input().replace(' ','^')))

Solution (Python):
x=input().split()
y=list(set(x))
print(y[x.count(y[0])-1])

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)
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=list(map(int,input().split()))
a.sort()
if a[1]==a[0]:
    print(a[2])
else:
    print(a[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 b==c:
	print(a)
else:
	print(b)

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

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

Solution (Python):
a=list(map(int,input().split()))
a.sort()
if a[1]==a[0]:
    print(a[2])
else:
    print(a[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());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 a==c:
  print(b)
else:
  print(a)

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


abc075_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):
def main():
    aa = sorted(map(int, input().split()))
    if aa[0] == aa[1]:
        print(aa[2])
    else:
        print(aa[0])


if __name__ == '__main__':
    main()

Solution (Python):
A,B,C=map(int,input().split())
if A==B and C!=A:
    print(C)
elif A==C and B!=A:
    print(B)
elif B==C and A!=B:
    print(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):
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()))
print(2*min(s)+2*max(s)-sum(s))

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()))
d = a-b
e = b-c

if d != 0 and e == 0:
  print(a)
elif d == 0 and e != 0:
  print(c)
elif d != 0 and e != 0:
  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())
t = a
if a==c:
	t = b
if a==b:
	t = c
print(t)

Solution (Python):



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


if __name__ == "__main__":
    main()

Solution (Python):
from statistics import mean, median,variance,stdev
import sys
import math

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

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=input().split()
if a==b:
  print(int(c))
elif a==c:
  print(int(b))
else:
  print(int(a))

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

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

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)
else:
    if 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(A^B^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())
if a == b:
  print(c)
if c == b:
  print(a)
if a == c:
  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 = input().split(" ")
if a == b:
  print(c)
elif a == c:
  print(b)
elif b == c:
  print(a)

Solution (Python):
from collections import Counter

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

c = Counter(l)

most = c.most_common()

print(most[1][0])

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

if A == B:
    print(C)
else:
    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 = [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 and a != c:
        print(a)
elif b != a and b != c:
        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=input().strip().split(" ")

b=[int(i) for i in a]

b.sort()

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

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 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 B == C:
    print(A)
else:
    print(B)

Solution (Python):
A, B, C = list(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().rstrip().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 = list(map(int,input().split()))
if a[0] == a[1]:
  print(a[2])
elif a[1] == a[2]:
  print(a[0])
else:
  print(a[1])

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 = sorted(list(map(int, input().split())))
print(a[0] if a[0] not in a[1:] else a[-1])

Solution (Python):
A,B,C=list(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, raw_input().split())
print A if B == C else B if A == C else C

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 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=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 = list(map(int, input().split()))

a = sorted(a)

if a[0] == a[1]:
    print(a[2])
else:
    print(a[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 = list(map(int, input().split()))

A.sort()

ans = A[0] if A[2] == A[1] else A[2]

print(ans)

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

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

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

Solution (Python):
a, b, c = list(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)
elif C == A:
  print(B)

Solution (Python):
import collections

Z = input().split()
c = collections.Counter(Z)

print(c.most_common()[-1][0])

Solution (Python):
abc = [int(m) for m in input().split(" ")]

for abc_i in set(abc):
    if abc.count(abc_i) == 1:
        print(abc_i)
        break

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^b^c)

Solution (Python):

li = list(map(int, input().split()))
print(max(li) if li.count(max(li))==1 else min(li))

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

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 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):
l = sorted(list(map(int, input().split())))
print(l[0] if l.count(l[0]) == 1 else l[2])

Solution (Python):
from collections import Counter
print(Counter(input().split()).most_common(2)[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 = 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())
d = a + b + c

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(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):
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):
print(eval(input().replace(' ','^')))

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 b if a == c else a)

Solution (Python):
a = list(map(int, input().split()))
for x in a:
  if a.count(x) == 1:
    print(x)
    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 = 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):



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


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==b:print(c)
elif a==c:print(b)
else:print(a)

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

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

Solution (Python):
abc = list(map(int, input().split()))
abc = [x for x in abc if abc.count(x) == 1]
print(*abc)

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

r = {}
for i in ABC:
    if i in r:
        r[i] +=1
    else:
        r[i] = 1
for a, i in r.items():
    if i == 1:
        print(a)
        exit()

Solution (Python):
(lambda a:[x if a.count(x)-1 else print(x) for x in a])(list(map(int,input().split())))

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)
else:
    print(b)

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

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 defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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


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 == 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):
print(eval(input().replace(' ','^')))

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

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

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, b, c = list(map(int, input().split()))

if a == b:
    print(c)

elif a == c:
    print(b)

else:
    print(a)

Solution (Python):
def main22():
    buf = input("");
    bufs = buf.split();
    hai = [];
    for i in range(len(bufs)):
        hai.append(int(bufs[i]));
    if hai[0] -hai[1] == 0:
        print(hai[2]);
    elif hai[0] -hai[2] == 0:
        print(hai[1]);
    else:
        print(hai[0]);







if __name__ == '__main__':
    main22()

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):
N = list(map(int,input().split(" ")))
for i in N:
    if N.count(i) == 1:
        print(i)
        break

Solution (Python):
A, B, C = [int(_) for _ 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)
else:
    if b == c:
        print(a)
    else:
        print(b)

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

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

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 defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]

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


A,B,C = inpl()
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:
    ans = C
if B == C:
    ans = A
if C == A:
    ans = B
print (ans)

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

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

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

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

Solution (Python):
A, B, C = list(map(int, input().split()))
ans = 0
if A==B:
    ans = C
elif A==C:
    ans = B
else:
    ans = A
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 and A == C :
    print(B)
elif A != B and A != C :
    print(A)
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())
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 main():
    a, b, c = map(int, input().split())

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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
abc = [int(m) for m in input().split(" ")]

for abc_i in set(abc):
    if abc.count(abc_i) == 1:
        print(abc_i)
        break

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

Solution (Python):

import math,string,itertools,fractions,heapq,collections,re,array,bisect

def s():
    return input()
def n():
    return int(input())
def d():
    return float(input())

def ls():
    return input().split()
def ln():
    return map(int, input().split())
def ld():
    return map(float, input().split())

def fs():
    return [input() for i in range(input())]
def fn():
    return [int(input()) for i in range(input())]
def fd():
    return [float(input()) for i in range(input())]


a,b,c = ln()
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 A == B: 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 = list(map(int,input().split()))

dup = [x for x in set(a) if a.count(x) > 1]

a.remove(dup[0])
a.remove(dup[0])

print(' '.join(map(str, a)))

Solution (Python):
a, b, c = map(int, input().split())
d = {}
for x in (a, b, c):
    if x in d.keys():
        d[x] += 1
    else:
        d[x] = 1
for k, v in d.items():
    if v == 1:
        print(k)
        exit()

Solution (Python):
num,num_1,num_2 = map(int,input().split())

if num == num_1:
    print(num_2)
elif num == num_2:
    print(num_1)
else:
    print(num)

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 == C:
	print(A)
elif A == C != B:
	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):

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

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

Solution (Python):
l = [int(x) for x in raw_input().split()]
print l[0] ^ l[1] ^ l[2]

Solution (Python):
a=[int(i) for i in input().split()]
a.sort()
print(a[0] if a[1]==a[2] else a[2])

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

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

Solution (Python):
x,y,z=[int(x) for x in str(input()).split()]
if x==y:
  print(z)
elif x==z:
  print(y)
else:
  print(x)

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

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

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())
if a==b:
  print(c)
elif a!=c:
  print(a)
else:
  print(b)

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

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

if A == B:
    print(C)
elif B == C:
    print(A)
elif A == C:
    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 and B == C:
  print(A)
if B != C and C == A:
  print(B)
if C != A and A == B:
  print(C)

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

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

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

if s[0] - s[1] == 0:
    print(s[2])
elif s[1] - s[2] == 0:
    print(s[0])
else:
    print(s[1])

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

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)
if B==C:
    print(A)
if A==C:
    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):
b=[int(i) for i in input().split()]
for j in b:
    a=b.count(j)
    if a==1:
        print(j)
        break

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

Solution (Python):
from collections import Counter
c = Counter(raw_input().split())
for k,v in c.items():
  if v==1:
    print k

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

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=[int(n) for n in input().split()]
if(a==b):
    print(c)
elif a==c:
    print(b)
else:
    print(a)

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

Solution (Python):
A,B,C=map(int,input().split())
if A == B :
  print(C)
elif B == C:
     print(A)
elif A == C:
     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)
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)

if A==C:
  print(B)

if B==C:
  print(A)

Solution (Python):

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

if A == B:
    print(C)
else:
    if 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 = sorted(list(map(int,input().split())))
i = 0 if a[1] != a[0] else 2
print(a[i])

Solution (Python):
a,b,c=map(int,input().split())
print([a,b,c][(a==c)+2*(a==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):
l = list(map(int, input().split()))
d = {}
for n in l:
    if n in d:
        d[n] += 1
    else:
        d[n] = 1
for k,v in d.items():
    if v == 1:
        print(k)

Solution (Python):
a,b,c=map(int,input().split())
if a==b :
    print("{}".format(str(c)))
elif b==c :
    print("{}".format(str(a)))
elif c==a :
    print("{}".format(str(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 = (int(i) for i in 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):
import sys

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

for i in range(3):
  if numlist.count(numlist[i]) == 1:
    print(numlist[i])
    sys.exit()