price=[10,20,4,5,4,6,46,43,4,64,65,8,45,55,558,15,5,4,6,5,255,5]
price.sort()
price.reverse()
max=price[0]
sec_max=price[1]
print(price)
print(f"the max is {max}, runner up is {sec_max}")if __name__ == '__main__':
n = int(input())
arr = map(int, input().split())
arr = list(arr)
x = max(arr)
y = -9999999
for i in range(0,n):
if arr[i]<x and arr[i] > y:
y = arr[i]
print(y)
n = int(input())
arr = list(map(int, input().split()))
zes = max(arr)
i=0
while(i<n):
if zes ==max(arr):
arr.remove(max(arr))
i+=1
print(max(arr))
#note: do not use set() will not work for negative numbers
# contact me : sandeshbhat2000@gmail.comif __name__ == '__main__':
n = int(input())
arr = map(int, input().split())
lista = list(arr)
lista.sort()
maximo = max(lista)
for actual in reversed(lista):
if actual == maximo:
lista.remove(max(lista))
print(max(lista))