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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 sys import exit
A,B,C = [int(n) for n in input().split()]
# N = int(input())
# a = [int(input()) for _ in range(N)]
# S = str(input())
# L = len(S)
# T = str(input())
# exit()
if A != B and B == C:
    print(A)
elif A == B and B != C:
    print(C)
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==B:
	print(C)
elif A==C:
	print(B)
elif B==C:
	print(A)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m,l=map(int,input().split(' '))
if n==m:
    print(l)
elif m==l:
    print(n)
else:
    print(m)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
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

#A
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

#B
def B():
    return

#C
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)
#D
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)
#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == "__main__":
    A()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc075/tasks/abc075_a

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = [int(x) for x 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, 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(a^c^b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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)
elif a == c:
    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:
# -*- coding: utf-8 -*-
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()

Submission status: Accepted

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

Submission status: Accepted

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

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=sorted([int(i) for i in input().split()])
print(a[0] if a.count(a[0])==1 else a[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = 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:
    ans = C
elif B == C:
    ans = A
else:
    ans = B

print(ans)
print()

Submission status: Accepted

Solution code:
a = input().split()
b = list(range(-100,101))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
abc = list(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 = input().split()
if a == b:
  print(c)
elif b == c:
  print(a)
else:
  print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
abc = list(map(int, input().split()))
c = collections.Counter(abc)
ans = c.most_common()[1][0]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
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:
L = sorted(list(input().split()))
if L[0] == L[1]:
  print(L[2])
if L[1] == L[2]:
  print(L[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
""" AtCoder """

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 Counter
A = Counter([int(i) for i in input().split()]).most_common()
print(A[1][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:
a = list(map(int,input().split()))
a.sort()

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

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:
from collections import Counter
cnt = Counter(list(map(int, input().split())))
print(cnt.most_common()[1][0])

Submission status: Accepted

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

if ([a,b,c].count(a) == 1) :
	print(a)
elif ([a,b,c].count(b) == 1) :
	print(b)
else :
	print(c)

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
# from collections import Counter, defaultdict

INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


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

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

Submission status: Accepted

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

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:
x=input().split()
y=list(set(x))
print(y[x.count(y[0])-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:
a=list(map(int,input().split()))
a.sort()
if a[1]==a[0]:
    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 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 and b == c and c != a:
    print(a)
elif a != b and b != c and c == a:
    print(b)
else:
    print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


abc075_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:
def main():
    aa = sorted(map(int, input().split()))
    if aa[0] == aa[1]:
        print(aa[2])
    else:
        print(aa[0])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]
a.sort()
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 A == C:
	print(B)
else:
	print(A)

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))
print(2*min(s)+2*max(s)-sum(s))

Submission status: Accepted

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

if d != 0 and e == 0:
  print(a)
elif d == 0 and e != 0:
  print(c)
elif d != 0 and e != 0:
  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)
else:
  print(B)

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    """Function."""
    a, b, c = map(int, input().split())
    if a == b:
        print(c)
    elif a == c:
        print(b)
    else:
        print(a)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int, 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:
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())
print(A^B^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)
if c == b:
  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(B)
else:
    print(A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

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

c = Counter(l)

most = c.most_common()

print(most[1][0])

Submission status: Accepted

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

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

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

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=input().strip().split(" ")

b=[int(i) for i in a]

b.sort()

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = sorted(list(map(int, input().split())))
print(a[0] if a[0] not in a[1:] else a[-1])

Submission status: Accepted

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

Submission status: Accepted

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

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

A.sort()

ans = A[0] if A[2] == A[1] else A[2]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
*a,=input().split()
for i in range(len(a)):
	if a.count(a[i])==1:
		print(a[i])
		exit()

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:
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:
import collections

Z = input().split()
c = collections.Counter(Z)

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