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

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

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

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

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

Solution (Python):
A,B,C=input().split()
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 = list(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()))
if l[0] == l[1] or l[0] == l[2]:
    print(sum(l)-2*l[0])
else:
    print(l[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(C if A == B else (A+B-C))

Solution (Python):
import sys as cghavcjhcbejwcbbsmbcjsdbcjdcadhbcjbdsjjcdjabjadbjsbcjdsbcsbcnsbcdnbcmbcmdabcdbjwhckfmknvskndleccdajbubcrjhebuoqbjhbjcdnaaayruegfubefruebhvy38bjhbvvbhcba
A,B,C = map(int,cghavcjhcbejwcbbsmbcjsdbcjdcadhbcjbdsjjcdjabjadbjsbcjdsbcsbcnsbcdnbcmbcmdabcdbjwhckfmknvskndleccdajbubcrjhebuoqbjhbjcdnaaayruegfubefruebhvy38bjhbvvbhcba.stdin.readline().split())

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

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

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

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

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

Solution (Python):


import sys
import math


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

Solution (Python):

def read_input():
    a, b, c = map(int, input().split())
    return a, b, c


def submit():
    a, b, c = read_input()

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


if __name__ == '__main__':
    submit()

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 functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

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

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

if a-b==0: 
  print(int(c))
elif b-c==0:
  print(int(a))
elif c-a==0:
  print(int(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):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a,b,c = f()
    print(a^b^c)

solve()

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


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):
l = [int(i) for i in 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,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)
elif a==c:
  print(b)
else:
  print(a)

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

Solution (Python):
a,b,c=map(int,input().split())
print([a if b==c else b,c][a==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):
print(eval(input().replace(" ", "^")))

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

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

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

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

Solution (Python):
a = [int(i) for i in 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,b,c=input().split()
print([a,b,c][(a==b)*2+(a==c)])

Solution (Python):


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

import collections

n2 = collections.Counter(n)

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

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

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

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

Solution (Python):
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(c) for c in input().split()]

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

Solution (Python):
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper

a, b, c = inl()
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 = [int(i) for i in input().split()]
if A == B:
  print(C)
elif B == C:
  print(A)
else:
  print(B)

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

Solution (Python):

a, b, c = 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(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 = 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):
line = input().rstrip().split(' ')
a = int(line[0])
b = int(line[1])
c = int(line[2])

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

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

Solution (Python):
x = list(map(int, input().split()))
print(x[0] ^ x[1] ^ x[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())
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())

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

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

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

Solution (Python):
numbers = list(map(int,input().split()))
for i in range(-100,101):
    if numbers.count(i) == 1 :
        print(i)

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

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

Solution (Python):
a=[int(i) for i in input().split(' ')]
a.sort()
print(sum(a) - 2*a[1])

Solution (Python):
a, b, c = [int(item) for item in input().split()]
if a == b:
    print(c)
elif b == c:
    print(a)
elif a == c:
    print(b)
else:
    print("wrong")

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 sys import exit
A,B,C = [int(n) for n in input().split()]






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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

Ts =[int(j) for j in input().split()]
for i in range(len(Ts)):
    if Ts.count(Ts[i])==1:
        print(Ts[i])

Solution (Python):
import collections
a = [int(i) for i in input().split()]
l = collections.Counter(a)
for k in l.keys():
    if l[k] == 1:
        print(k)

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,m,l=map(int,input().split(' '))
if n==m:
    print(l)
elif m==l:
    print(n)
else:
    print(m)

Solution (Python):
a,b,c=input().split();print([[b,a][b==c],c][a==b])

Solution (Python):
A=list(map(int,input().split()))
print(min(A,key=A.count))

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

if a in (b, c):
    print(b + c - a)
elif b == c:
    print(a)
else:
    print(b)

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

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

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

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007


def A():
    a,b,c = LI()
    if a not in [b,c]:
        print(a)
    elif b not in [a,c]:
        print(b)
    else:
        print(c)
    return


def B():
    return


def C():
    def bfs(a,b):
        bfs_map = [1 for i in range(n)]
        bfs_map[0] = 0
        q = deque()
        q.append(0)
        s = 1
        while q:
            x = q.pop()
            for y in v[x]:
                if [x,y] != [a,b] and [x,y] != [b,a]:
                    if bfs_map[y]:
                        bfs_map[y] = 0
                        q.append(y)
                        s += 1
        return s
    n,m = LI()
    v = [deque() for i in range(n)]
    l = deque()
    for i in range(m):
        a,b = LI()
        a -= 1
        b -= 1
        v[a].append(b)
        v[b].append(a)
        l.append([a,b])
    ans = 0
    for a,b in l:
        s = bfs(a,b)
        if s < n:
            ans += 1
    print(ans)

def D():
    n,k = LI()
    v = [None for i in range(n)]
    for i in range(n):
        v[i] = LI()
        v[i] = [[None,None]]+[v[i]]
    v.sort(key = lambda x:x[1][1])
    for i in range(n):
        v[i][0][1] = i
    v.sort(key = lambda x:x[1][0])
    for i in range(n):
        v[i][0][0] = i
    po = [[None for i in range(n)] for j in range(n)]
    h = [None for i in range(n)]
    w = [None for i in range(n)]
    for i in range(n):
        po[v[i][0][0]][v[i][0][1]] = v[i][1]
        h[v[i][0][0]] = v[i][1][0]
        w[v[i][0][1]] = v[i][1][1]
    re = [[[[0 for x in range(n)] for y in range(n)] for t in range(n)] for s in range(n)]
    ans = float("inf")
    for s in range(n):
        for t in range(n):
            for y in range(s,n):
                for x in range(t,n):
                    if x == t:
                        re[s][t][y][x] = re[s][t][y-1][x]
                    else:
                        re[s][t][y][x] = max(0,re[s][t][y][x-1]+re[s][t][y-1][x]-re[s][t][y-1][x-1])
                    if po[y][x] != None:
                        re[s][t][y][x] += 1
                    if re[s][t][y][x] >= k:
                        ans = min(ans,(h[y]-h[s])*(w[x]-w[t]))
    print(ans)

def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == "__main__":
    A()

Solution (Python):


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

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

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

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

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

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

Solution (Python):


import itertools
import collections
import bisect

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

if __name__ == '__main__':
    main()

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

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

if x == y:
    print(z)
elif x == z:
    print(y)
else:
    print(x)

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

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

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

Solution (Python):
def one_out_of_three(A: int, B: int, C: int)->int:
    if A == B:
        return C
    if A == C:
        return B
    return A


if __name__ == "__main__":
    A, B, C = map(int, input().split())
    ans = one_out_of_three(A, B, C)
    print(ans)

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

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

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

Solution (Python):
A, B, C = [int(_) for _ in input().split()]
print((max(A, B, C) * min(A, B, C)) ** 2 // A // B // C)

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

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

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

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

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

Solution (Python):
import sys

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

Solution (Python):
n = list(map(int,input().split(' ')))
print(str(max([i if n.count(i)==1 else -10000 for i in list(dict.fromkeys(n))])))

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

Solution (Python):



def func(a, b, c):
    if a == b:
        result = c
    elif b == c:
        result = a
    else:
        result = b
    
    return result


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

Solution (Python):



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

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import cmath
import numpy as np
import sys

INF=1e18
MOD=1e9+7

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


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

Solution (Python):
A, B, C = map(int, input().split())
print(A ^ B ^ 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):
l = input().split()
for i in range(3):
  if l.count(l[i]) == 1:
    print(l[i])

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

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

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

import sys

def main():
	a, b, c = map(int, input().split(" "))
	
	if a == b:
		print(c)
	if b == c:
		print(a)
	if c == a:
		print(b)
	
if __name__ == "__main__":
	main()

Solution (Python):

N = sorted(list(map(int, input().split())))
print([N[0], N[2]][N[0] == N[1]])

Solution (Python):
from sys import stdin
l = [int(x) for x in stdin.readline().rstrip().split()]
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):
A,B,C=map(int,input().split())
if A==B:
    print(C)
elif A==C:
    print(B)
else:
    print(A)

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

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

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

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

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

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

print(ans)
print()

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().split()
b = list(range(-100,101))

for i in b:
    if a.count(str(i)) == 1:
        print(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())

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

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

Solution (Python):
abc = list(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 = 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=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())
print(a^b^c)

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

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

Solution (Python):
import collections
abc = list(map(int, input().split()))
c = collections.Counter(abc)
ans = c.most_common()[1][0]
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=list(map(int,input().split()))
A.sort()
if (A[0]+A[1])/2==A[0]:
  print(A[2])
else:
  print(A[0])

Solution (Python):
numlist = list(input().split())
print(sorted(numlist,key=lambda x:numlist.count(x))[0])

Solution (Python):
import heapq
from collections import deque
from enum import Enum
import sys
import math
from _heapq import heappush, heappop

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001

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

if A == B:
    print("%d"%(C))
elif A == C:
    print("%d"%(B))
else:
    print("%d"%(A))

Solution (Python):
ls = list(input().split())


print(sorted(ls, key=lambda x: ls.count(x))[0])