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):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

a = sorted(list(map(int, input().split())))
print(a[0] if a.count(a[0]) != 2 else a[2])

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

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

print(ans)

Solution (Python):


A,B,C=input().split(" ")

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

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

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

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

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

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

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

Solution (Python):
from sys import stdin
import math
import bisect
import heapq
import numpy as np
from math import factorial
inf = 10**10

a,b,c = [int(x) for x in stdin.readline().rstrip().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):
N = input().split()
N.sort()
print(N[2] if N[0] == N[1] else N[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):
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 = map(int,input().split())
if a==b:
    print(c)
elif a==c:
    print(b)
else:
    print(a)

Solution (Python):
def examA():
    A, B, C = LI()
    if A==B:
        ans = C
    else:
        if A==C:
            ans = B
        else:
            ans = A
    print(ans)



import sys,copy,bisect,itertools
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

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

l.sort()

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

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

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

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=input()
a=[int(x) for x in a.split()]
print(a[0] if a[1]==a[2] else a[1] if a[0]==a[2] else a[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):
from collections import Counter
for key, nums in Counter(list(map(int,input().split()))).items():
  if nums == 1: print(key)

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

Solution (Python):
import sys

a, b, c = (int(x) for x in sys.stdin.readline().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)
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==b: print(c)
elif b==c: print(a)
else: print(b)

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 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=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):

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b,c=INTM()
    if a==b:
        print(c)
    elif a==c:
        print(b)
    else:
        print(a)
if __name__ == '__main__':
    do()

Solution (Python):

a, b, c = [int(s) for s in input().split()]

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

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

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=list(map(int, input().split()))
a=[]
b=[]
for case in n:
    if len(a)==0:
        a.append(case)
    elif case==a[0]:
        a.append(case)
    else:
        b.append(case)
if len(a)<len(b):
    print(a[0])
else:
    print(b[0])

Solution (Python):



def main():
    A, B, C = [int(ele) for ele in input().split()]
    if A == B:
        print(C)
    elif B == C:
        print(A)
    elif C == A:
        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 = (int(x) for x in input().split())

list = [A, B, C]
import collections

count = collections.Counter(list)
keys = [k for k, v in count.items() if v== 1]
print(keys[0])

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

Solution (Python):
a = [int(_) for _ in input().split()]
a.sort()
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 = map(int, input().split())
if a == b:
  print(c)
elif b == c:
  print(a)
elif c == a:
  print(b)

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

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

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

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

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

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=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())
a = max(A,B,C)
b = min(A,B,C)
if [A,B,C].count(a)==1:
    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 b == c:
    print(a)
elif a == c:
    print(b)
else:
    print(c)

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

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    a, b, c = list(map(int, input().rstrip('\n').split()))
    print(a ^ b ^ c)


if __name__ == '__main__':
    slove()

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

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

Solution (Python):
l = input().split()
print([e for e in set(l) if l.count(e) == 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=a[0]
B=a[1]
C=a[2]
if a.count(max(a))==1:
    print(max(a))
else:
    print(min(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 = 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 b==c:
    print(a)
elif c==a:
    print(b)
else:
    print(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:
    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())

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

Solution (Python):
l1, l2, l3 = map(int, input().split())
print(l1 ^ l2 ^ l3)

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()))
for i in range(3):
    if S.count(S[i])==1:
        print(S[i])

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    a, b, c = list(map(int, input().rstrip('\n').split()))
    print(a ^ b ^ c)


if __name__ == '__main__':
    slove()

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
li = list(map(int, input().split()))
count = Counter(li)
print(count.most_common()[1][0])

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):
ABC = list(map(int,input().split()))
print(2*sum(set(ABC))-sum(ABC))

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

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

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

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

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

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

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

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

Solution (Python):
a,b,c=map(int,input().split())
print(sum({a,b,c})*2-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):
t=input().split()
t=[int(s) for s in t]
if t[0]==t[1]:
	print(t[2])
elif t[0]==t[2]:
	print(t[1])
else:
	print(t[0])

Solution (Python):


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

if abc.count(abc[0]) == 1:
    print(abc[0])
elif abc.count(abc[1]) == 1:
    print(abc[1])
else:
    print(abc[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(a if b == c else b if a == c else c)

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

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

Solution (Python):

ns = list(map(int, input().split()))
ns = sorted(ns)
if (ns[0] == ns[1]): print(ns[-1])
else: print(ns[0])

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
a,b,c=map(int,input().split())


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

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

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

num = collections.Counter(a)

print(*list(filter(lambda key: num[key] == 1, num)))

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

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
import math
from fractions import gcd





def lcm(a, b):
    return a * b // gcd(a, b)

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

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

big_prime = 1000000007

"""


 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())


 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

X =  list(map(int, sys.stdin.readline().split()))

if X.count(X[0]) == 1:
    print(X[0])
elif X.count(X[1]) == 1:
    print(X[1])
else:
    print(X[2])

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

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

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

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

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

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

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

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

Solution (Python):
a,b,c = input().strip().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 and a != c:
  print(a)
if b != a and b != c:
  print(b)
if c != a and c != b:
  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 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):
def resolve():
    a, b, c = map(int, input().split())
    if a == b: print(c)
    if c == b: print(a)
    if a == c: print(b)


if __name__ == "__main__":
    resolve()

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

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

Solution (Python):
numbers = input().split()
rest = []

for i in range(len(numbers)):
    if numbers[i] not in rest:
        rest.append(numbers[i])
    else:
        index = rest.index(numbers[i])
        rest.pop(index)
print(rest[0])

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

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

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

Solution (Python):
a, b, c = input().split()
if a == b:
    print(int(c))
elif c == a:
    print(int(b))
else: print(int(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 A!=B and A!=C else B if A!=B and B!=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):
print(eval(input().replace(' ','^')))

Solution (Python):
a = [int(_) for _ in input().split()]
print(a[0] ^ a[1] ^ a[2])

Solution (Python):
a = [int(_) for _ in input().split()]
if len(a) == 3 and all(-100 <= item <= 100 for item in a):
    if a[0] == a[1]:
        print(a[2])
    elif a[0] == a[2]:
        print(a[1])
    elif a[1] == a[2]:
        print(a[0])
else:
    print('hoge!')

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

Solution (Python):
import sys
import  math
import bisect
from statistics import *
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

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

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

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

Solution (Python):
print((lambda x:sum(x)-2*x[1]) (sorted(list(map(int,input().split())))))

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

Solution (Python):

def main():
    A, B, C = tuple(map(int, input().split()))
    ans = A ^ B ^ C
    print(ans)


if __name__ == "__main__":
    main()

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):
import sys
input = sys.stdin.readline
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 = list(map(int, input().split()))

A.sort()
if A[0] != A[1]:
    print(A[0])
else:
    print(A[-1])

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

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

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

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

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

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

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

Solution (Python):
def main():
    A, B, C = map(int, input().split())
    if A == B: return C
    if A == C: return B
    if B == C: return A
if __name__ == '__main__':
    print(main())

Solution (Python):
lst = list(input().split())
for s in lst:
    if lst.count(s) == 1:
        print(s)
        break

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