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


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

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

main()

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

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

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):
arr = list(map(int, input().split()))
print(sum(arr)-sorted(arr)[1]*2)

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

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

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

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

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

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

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

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

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

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

Solution (Python):

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

Solution (Python):

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

def main():
    mod=10**9+7
    a,b,c=MI()
    if a==b:
        print(c)
    else:
        print(a+b-c)

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

Solution (Python):




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


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

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):
import math
import itertools
import statistics


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

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

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

Solution (Python):
a, b, c = map(int,input().split())
if a==b:
    print(c)
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):
S=list(map(int,input().split()))
for i in range(3):
    if S.count(S[i])==1:
        print(S[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())
print(a if b==c else b if a==c else c)

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

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

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

Solution (Python):
from collections import Counter
L=list(map(int,input().split()))
A=Counter(L)
print(A.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):
l = list(map(int, input().split()))
for i in l:
    if l.count(i) != 2:
        print(i)
        break

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

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

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


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

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

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

if l[0] == l[1]:
  print(l[2])
elif l[0] == l[2]:
  print(l[1])
elif l[1] == l[2]:
  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())
if a!=b:
    if a==c:
        print(b)
    else:
        print(a)
else:
    print(c)

Solution (Python):
def differenceone(a , b , c):

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

    return ans

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

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
nums = input().split()
num1 = int(nums[0])
num2 = int(nums[1])
num3 = int(nums[2])
for x in nums:
    if nums.index(x)+1 < len(nums):
        if x != nums[nums.index(x)+1] and x != nums[nums.index(x)-1]:
            print(x)
    else:
        if x != nums[0] and x != nums[1]:
            print(x)

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

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

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

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

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

for i in a_list:
    if a_list.count(i) == 2:
        pass
    else:
        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=[int(s) for s in 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):
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):
a,b,c= map(int,input().split())

if a==b:
    print(c)

elif a==c:
    print(b)

else:
    print(a)

Solution (Python):
a=list(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 c==b:
  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 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 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):
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(str, 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
a = list(map(int, input().split()))
cnt = Counter(a)
print(cnt.most_common()[-1][0])

Solution (Python):




def main():
    A, B, C = map(int, input().split())
    ABC = sorted([A, B, C])
    print(ABC[2] if ABC[1] == ABC[0] else ABC[0])


if __name__ == "__main__":
    main()

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

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

Solution (Python):
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys
import itertools



read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

if (A!=B) & (A!=C):
  print(A)
elif (B!=A) & (B!=C):
  print(B)
else:
  print(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):
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 c==a 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=map(int,input().split())
dic={}
dic[a]=1
dic[b]=1
dic[c]=1
dic[a]+=1
dic[b]+=1
dic[c]+=1
print(list(dic.keys())[list(dic.values()).index(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^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())
tmp = sorted([A, B, C])

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

Solution (Python):
import sys
input = sys.stdin.readline
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:
  r = C
elif A == C:
  r = B
else:
  r = A
  
print(r)

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

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

Solution (Python):
def dif_num(x,y):
    if x == y:
        return 0
    else:
        return 1

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline().strip
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 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):
x,y,z=map(int, input().split())

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

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 permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): 
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

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

def divisors(a): 
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    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)
    return

if __name__=='__main__':
    main()

Solution (Python):
strs = sorted(list(input().split()))

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

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

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

Solution (Python):

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

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

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

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

Solution (Python):
a = sorted([int(i) for i in 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:
    print(C)
elif B==C:
    print(A)
else:
    print(B)

Solution (Python):
ABC=list(map(int,input().split()))
for i in range(2):
    for j in range(i+1,3):
        if ABC[i]==ABC[j]:
            onaji=ABC[i]
            break
print(sum(ABC)-onaji*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):
A, B, C = map(int, input().split())
ans = A
if A == B: ans = C
if A == C: ans = B
print(ans)

Solution (Python):
from collections import Counter

A = Counter(list(input().split()))
for k, v in A.items():
  if v == 1:
    print(k)
    exit()

Solution (Python):
import sys
input = sys.stdin.readline
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(lambda x: x, 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):
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)
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=sorted([int(i) for i in input().split()])
b,c=a[0],a[2]
print(b if a.count(b)==1 else c)

Solution (Python):
a = list(map(int,input().split()))
ans = [x for x in set(a) if a.count(x) < 2]
print(int(ans[0]))

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

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

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

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

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

if __name__ == '__main__':
    ans = main()
    print(ans)

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

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

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

for i in range(2):
    if lst[i] == lst[i+1]:
        print(sum(lst) - 2*lst[i])

Solution (Python):
import math

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

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

Solution (Python):
import sys

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

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

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

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

Solution (Python):
from sys import stdin
A,B,C = [int(x) for x in stdin.readline().rstrip().split()]
d = sorted([A,B,C])
if d[0] == d[1]:
    print(d[2])
else:
    print(d[0])

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

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

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

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

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

Solution (Python):
from collections import Counter
l = [int(i) for i in input().split()]

c = Counter(l)

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

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

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

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:
    ans = c
elif a == c:
    ans = b
else:
    ans = a

print(ans)

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

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

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

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

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

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

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

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A=LI()
    D=set()
    for a in A:
        if a in D:
            D.remove(a)
        else:
            D.add(a)
    for d in D:
        print(d)
if __name__ == '__main__':
    main()

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


main()

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

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


main()

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

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

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

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

Solution (Python):
X = list(map(int,input().split()))
X.sort()
print(sum(X)-X[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)