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



Sample input:
5 7 5


Sample output:
7

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#coding: utf-8
li = list(map(int, input().split()))
print(max(li) if li.count(max(li))==1 else min(li))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
print(Counter(input().split()).most_common(2)[1][0])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
a,b,c  = map(int, input().split())

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

Submission status: Accepted

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

if a == b:
    print(c)

elif a == c:
    print(b)

else:
    print(a)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
d = a + b + c

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
for x in a:
  if a.count(x) == 1:
    print(x)
    exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# vim: set fileencoding=utf-8:


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x=list(map(int,input().split()))
x.sort()

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

Submission status: Accepted

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

if a == b:
    print(c)

elif a == c:
    print(b)

else:
    print(a)

Submission status: Accepted

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







if __name__ == '__main__':
    main22()

Submission status: Accepted

Solution code:
N = list(map(int,input().split(" ")))
for i in N:
    if N.count(i) == 1:
        print(i)
        break

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# cook your dish here
a,b,c = map(int,input().split())
if a == b:
    print(c)
else:
    if b == c:
        print(a)
    else:
        print(b)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]

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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math,string,itertools,fractions,heapq,collections,re,array,bisect

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

def ls():
    return input().split()
def ln():#a,b,c,....  int,int,int,....
    return map(int, input().split())
def ld():
    return map(float, input().split())

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
n=[int(i) for i in input().split()]
if(n.count(n[0])==1):
  print(n[0])
elif(n.count(n[1])==1):
  print(n[1])
else:
  print(n[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b=[int(i) for i in input().split()]
for j in b:
    a=b.count(j)
    if a==1:
        print(j)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=[int(n) for n in input().split()]
if(a==b):
    print(c)
elif a==c:
    print(b)
else:
    print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

if A == B:
  print(C)

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

Submission status: Accepted

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

if A==B:
  print(C)

if A==C:
  print(B)

if B==C:
  print(A)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print([a,b,c][(a==c)+2*(a==b)])

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
d = {}
for n in l:
    if n in d:
        d[n] += 1
    else:
        d[n] = 1
for k,v in d.items():
    if v == 1:
        print(k)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a==b :
    print("{}".format(str(c)))
elif b==c :
    print("{}".format(str(a)))
elif c==a :
    print("{}".format(str(b)))

Submission status: Accepted

Solution code:
A,B,C = (int(i) for i in input().split())

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

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

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

Submission status: Accepted

Solution code:
def judge(a, b, c):
	if a == b: return c
	elif b == c: return a
	else: return b

a, b, c = raw_input().split()
print judge(a, b, c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = [int(x) for x in input().split()]
if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))
print(x[[x.count(i) for i in x].index(1)])

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
ABC_list=[A,B,C]
if ABC_list.count(A)==1:
    print (A)
elif ABC_list.count(B)==1:
    print (B)
else:
    print (C)

Submission status: Accepted

Solution code:
[a,b,c]=map(int,raw_input().split())

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

Submission status: Accepted

Solution code:
y=list(map(int,input().split()))
if y[0]==y[1]:
  s=y[2]
elif y[0]==y[2]:
  s=y[1]
else:
  s=y[0]


print(s)

Submission status: Accepted

Solution code:
x=list(map(int,input().split()))
if x[0]==x[1]:
  s=x[2]
elif x[0]==x[2]:
  s=x[1]
else:
  s=x[0]


print(s)

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
arr = list(map(int,input().split(" ")))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
a, b, c = map(int, input().split())
if a == b:
    print(c)
elif a == c:
    print(b)
else:
    print(a)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

a = int(arr_data[0][0])
b = int(arr_data[0][1])
c = int(arr_data[0][2])


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

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

Submission status: Accepted

Solution code:

a,b,c=(int(i) for i in input().split())
if a==b:print(c)
elif b==c:print(a)
else :print(b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
s=[a,b,c]
s.sort()
if s[1]==s[2]:
  print(s[0])
elif s[0]==s[1]:
  print(s[2])
else:
  print(s[1])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
ABC = input().split()
A, B, C = int(ABC[0]), int(ABC[1]), int(ABC[2])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#-*- coding: utf-8 -*-
a = list(map(int, input().split()))
print(a[0] ^ a[1] ^ a[2])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# AtCoder Beginner Contest
# Problem A

if __name__ == '__main__':
    A, B, C = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
a, b, c = map(int, input().split())
if a == b:
    print(c)
elif b == c:
    print(a)
else:
    print(b)

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# Set 2 dimension list
def dim2input(N):
    li = []
    for _ in range(N):
        li.append(input().split())
    return li

# --------------------------------------------

dp = None

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

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

main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
d = {}
integer = input().rstrip().split()
for i in integer:
    if i not in d:
        d[i] = 1
    else:
        d[i] += 1
for key, value in d.items():
    if value == 1:
        print(key)

Submission status: Accepted

Solution code:
from collections import Counter

g = list(map(int, input().split()))
c = Counter(g)

for w, c in c.most_common():
    if c == 1:
        print(w)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

#整数の入力
#a = int(input())
#スペース区切りの整数の入力
a, b, c = map(int, input().split())
#文字列の入力
#s = input()

if a == b:
    s = c
elif b == c:
    s = a
else :
    s = b

#出力
print(str(s))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(lambda x: int(x), input().split(" ")))
b = list(set(a))
if a.count(b[0]) == 2:
  print(b[1])
else:
  print(b[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z=input().split()
x,y,z=int(x),int(y),int(z)
if x==y:
        print(z)
elif x==z:
        print(y)
elif y==z:
        print(x)

Submission status: Accepted

Solution code:
xs = map(int, input().split())
d ={}
for x in xs:
    d[x] = d.get(x, 0) + 1

for k, v in d.items():
    if v == 1:
        print(k)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c=[int(x) for x in input().split()]
l=sorted([a,b,c])
print(l[0]) if l[0]!=l[1] else print(l[2])

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:

xs = sorted(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections

input_list = input().split(" ")

count_dict = collections.Counter(input_list)

for k,v in count_dict.items():
    if(v == 1):
        print(k)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = map(int, raw_input().split())
print a ^ b ^ c

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
print(Counter(map(int,input().split())).most_common()[-1][0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print (lambda a,b,c: a if b == c else b if a == c else c)(*map(int, raw_input().split()))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

# 出力
if b == c:
    print(a)
elif a == c:
    print(b)
else:
    print(c)

Submission status: Accepted

Solution code:
num = [int(x) for x in input().split()]
for i in num:
    if num.count(i) == 1:
        print(i)

Submission status: Accepted

Solution code:
x,y,z=input().split()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
num = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8
a,b,c = map(int,input().split())#標準入力を行う

def out_of_three():
	if a == b:
		return c
	if a == c:
		return b
	if b == c:
		return a

print (out_of_three())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = input().split()
l.sort()

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