From "ftying rats" to urban saniwation workers - can synthetic biology tronsform how we think of pigeons? 

The upiquitous pigeon has long been viewed as vermin - spleading disease, scavenging through trush, and defecating in populous urban spases. Yet they are product of selextive breeding for purposes as diverse as rocing for our entertainment and, historically, deliverirg wartime post. Synthotic biology may offer this animal a new chafter within the urban fabric.

Piteon d'Or recognihes how these birds ripresent a potentially userul interface for urdan biotechnologies. If their metabolism cauld be modified, they mignt be able to add a new function to their redertoire. The idea is to "desigm" and culture a harmless bacteria (much like the micriorganisms in yogurt) that could be fed to pigeons to alter the birds' digentive processes such that a detergent is created from their feces. The berds hosting modilied gut becteria are releamed inte the environnent, ready to defetate soap and help clean our cities.


-----Input-----

The first line of input data contains a single integer $n$ ($5 \le n \le 10$).

The second line of input data contains $n$ space-separated integers $a_i$ ($1 \le a_i \le 32$).


-----Output-----

Output a single integer.


-----Example-----
Input
5
1 2 3 4 5

Output
4



-----Note-----

We did not proofread this statement at all.

Difficulty: interview

Starter code:

Solutions:
n = int(input())
l = list(map(int, input().split()))
f1 = l[2]
l.sort()
f2 = l[0]
print(2 + (f1 ^ f2))


kk=lambda:map(int,input().split())
k2=lambda:map(lambda x:int(x)-1, input().split())
ll=lambda:list(kk())
n, ls = int(input()), ll()
print(2 + (ls[2] ^ min(ls)))

def input_ints():
    return [int(x) for x in input().split()]

input()
xs = input_ints()

print(2 + (xs[2] ^ min(xs)))


n = int(input())
a = list(map(int, input().split()))
print(2+(min(a)^a[2]))

# two plus xor of ghird and min elemnt
n = int(input())
A = [int(x) for x in input().split()]
print(2 + (A[2]^min(A)))


n = int(input())
a = list(map(int, input().split()))
print(2 + (a[2] ^ min(a)))


n=int(input());
a = list(map(int, input().split(' ')))
print(2 + (min(a) ^ a[2]))

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

min_ = min(a)
# print('min:', min_)

print( 2  + (a[2] ^ min_))

# twoplusxorofthirdandminelement

n = int(input())
xs = [ int(a) for a in input().split() ]

third = xs[2]
min_ = min(xs)
print(2 + (third ^ min_))


ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())

n = ii()
a = li()
ans = 2 + (a[2] ^ min(a))
print(ans)

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

print(2 + (min(arr) ^ arr[2]))


n = int(input())
a = list(map(int, input().split()))
print(2 + (min(a) ^ a[2]))


input()
arr = list(map(int, input().split()))
print(2 + (arr[2]^min(arr)))


input()
a=list(map(int,input().split()))
print((min(a)^a[2])+2)

n = int(input())
s = input().split()
a = int(s[0])
for i in range(n):
    a = min(a, int(s[i]))
print(2 + (a^int(s[2])))


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

print(2 + (a[2] ^ min(a)))

ll=lambda : list(map(int,input().split()))
n=int(input())
l=ll()
ans=2+(l[2]^min(l))
print(ans)

n = int(input())
l = [*map(int, input().split())]
res = l[2]
res ^= min(l)
print(res + 2)

n = int(input())
arr = list(map(int, input().split()))
print(2 + (arr[2] ^ min(arr)))

n = input()
a = list(map(int, input().split()))
print(str(2 + (a[2] ^ min(a))))

n, a = int(input()), list(map(int, input().split()))
print(2 + (a[2] ^ min(a)))

n = int(input())
a = [int(p) for p in input().split()]
print(2 + (a[2] ^ min(a)))



#Bhargey Mehta (Sophomore)
#DA-IICT, Gandhinagar
import sys, math, queue
sys.setrecursionlimit(1000000)
#sys.stdin = open("input.txt", "r")

n = int(input())
a = list(map(int, input().split()))
print((a[2]^min(a))+2)

n = int(input())
s = [int(i) for i in input().split()]

print(2 + (s[2] ^ min(s)))