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

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 = [int(i) for i in input().split()]

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def I():
    
     return int(sys.stdin.readline().rstrip())
def LI():
    
     return list(map(int,sys.stdin.readline().rstrip().split()))
def S():
    
     return sys.stdin.readline().rstrip()
def LS():
    
     return list(sys.stdin.readline().rstrip().split())


xs=LI()

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def I():
    
    return int(sys.stdin.readline().rstrip())
def LI():
    
    return list(map(int,sys.stdin.readline().rstrip().split()))
def S():
    
    return sys.stdin.readline().rstrip()
def LS():
    
    return list(sys.stdin.readline().rstrip().split())
def println(s):
    print(f"{s}\n")


xs  = LI()

if xs[0] == xs[1]:
    println(xs[2])
elif xs[0] == xs[2]:
    println(xs[1])
else:
    println(xs[0])

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

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

Solution (Python):
lst = input().split()

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

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

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

for i in b:
  if (a.count(i))==1:
    print(i)

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

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

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

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

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 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):
l=list(map(int,input().split()))
from collections import Counter
l=list(Counter(l).most_common())
print(l[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):
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):
s=list(map(int,input().split()))
i=set(s)
print(sum(i)-(sum(s)-sum(i)))

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

Solution (Python):
x,y,z=map(int,input().split())
print(z if x == y else y if x == z else x)

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):
l=sorted(map(int,input().split()))
print(sum(l)-l[1]*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):
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:
    print(c)
elif c == b:
    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 main():
    a, b, c = map(int, 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 =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 = input().split(' ')

for i in a:
    if (a.count(i)==1):
        print(i)

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

print(A if B == C else C)

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    x = list(map(int, readline().split()))

    for y in x:
        if x.count(y) == 1:
            print(y)


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

Solution (Python):
a, b, c=map(int,input().split())
if a==b:
  print(c)
elif c==b:
  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):
from collections import Counter

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

cnt = Counter(ABC)
values, counts = zip(*cnt.most_common(2))

print(values[1])

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

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

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

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

Solution (Python):
l = list(map(int, input().split()))
for ll in l:
    if l.count(ll)==1:
        print(ll)
        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 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)
elif C == A:
    print(B)

Solution (Python):
import sys, collections
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    ABC = LI()

    cnt = collections.Counter(ABC)
    ans = [k for k, v in cnt.items() if v == 1]
    print(ans[0])

if __name__ == '__main__':
    resolve()

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


result = 0

if a == b:
    result = c
elif b == c:
    result = a
elif a == c:
    result = b
else:
    result = "Error"

print(result)

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] = 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 == 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 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())
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)
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 == 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,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)
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):
integer1, integer2, integer3 = map(int, input().split())
if integer2 == integer3:
    print(integer1)
elif integer1 == integer3:
    print(integer2)
else:
    print(integer3)

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 ^ B ^ C)

Solution (Python):

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


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

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

Solution (Python):
a, b, c = (int(x) for x 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 and B != C:
    print(C)
elif A == C and A != B and C != B:
    print(B)
else:
    print(A)

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

for int_ in int_s:
    if int_s.count(int_) == 1:
        print(int_)
        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 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)

if b==c:
    print(a)

if c==a:
    print(b)

Solution (Python):
a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
ls=[a,b,c]
ls.sort()
if ls[0]==ls[1]:
  print(ls[2])
else:
  print(ls[0])

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



A, B, C= S_list[0], S_list[1], S_list[2]
AB, BC, CA = A-B, B-C, C-A
if AB*BC !=0 :
    print(B)
elif CA*AB !=0 :
    print(A)
else:
    print (C)

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

Solution (Python):
a, b, c = (int(x) for x in 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(maxsplit=3))







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


print(answer)

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

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

Solution (Python):
al=list(map(int,input().split()))
al.sort()
print(sum(al)-al[1]*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)
elif A == C:
    print(B)
elif B == C:
    print(A)

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

print(ans)

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)
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=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();print([[b,c][a==b],a][b==c])

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

elif a[1]!=a[0]and a[1]!=a[2]:
  print(a[1])

else:
  print(a[2])

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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):
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

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 = (int(T) for T in input().split())
print(A^B^C)

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

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

Solution (Python):
a,b,c = (int(x) for x 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 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):
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    A,B,C=mi()
    X = set()
    y = 0
    for x in [A,B,C]:
        if x in X: y = x
        X.add(x)

    for x in [A,B,C]:
        if x != y:
            print(x)
            exit()





if __name__ == "__main__":
    main()

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

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

    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 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(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())
s=(a,b,c)
for i in s:
 if s.count(i)==1:print(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 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)
elif a==c:
  print(b)
else:
  print(a)

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

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    A = list(map(int, readline().split()))
    A.sort()
    if A[0] == A[1]:
        print(A[2])
    else:
        print(A[0])
    
    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):
tmp = input().split(" ")
if tmp[0] == tmp[1]:
  print(tmp[2])
elif tmp[0] == tmp[2]:
  print(tmp[1])
else:
  print(tmp[0])

Solution (Python):
from collections import Counter

lis = list(input().split())

a = Counter(lis)

for k, v in a.items():
    if a[k] == 1:
        print(k)

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



if __name__ == "__main__":
    solve()

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):
As = list(map(int, input().split()))
for a in As:
    if As.count(a) == 1:
        print(a)
        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 B==C:
	print(A)
else:
	print(B)

Solution (Python):

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


ans = 0


l = [a,b,c]

if l.count(a) == 1:
    print(a)
elif l.count(b) == 1:
    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):
import collections
A=collections.Counter(map(int,input().split()))
for  k,v in A.items():
  if v==1:
    print(k)

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
def input(): return sys.stdin.readline().strip()

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

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

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

Solution (Python):
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())

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

Solution (Python):
n = [x for x in input().split()]
for i in n:
    if n.count(i) == 1:
        print(i)
        break

Solution (Python):
def main():
    *args, = map(int, input().split())
    args.sort()
    if args[0] == args[1]:
        print(args[2])
        return

    print(args[0])


if __name__ == '__main__':
    main()

Solution (Python):
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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

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
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

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

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

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

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())
for i in [a, b, c]:
    if [a, b, c].count(i) == 1:
        print(i)
        exit()

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(input().split())
print([x for x in set(ABC) if ABC.count(x) == 1][0])

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

Solution (Python):
List = list(map(int, input().split()))
res = 0
for i in range(2):
  for j in range(i+1,3):
    if List[i] == List[j]:
      res = 3 - i - j
print(List[res])

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(list(map(int, input().split())))
a = [i[0] for i in a.items() if i[1]==1]
print(a[0])

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

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

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

Solution (Python):
import collections
A,B,C=map(int,input().split())
ABC=[A,B,C]
ABC=collections.Counter(ABC)
if ABC[A]==1:
    print(A)
elif ABC[B]==1:
    print(B)
else:
    print(C)

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