Определить число, меньше которого только самое наименьшее число в последовательности

a = int(input())
minimum = a
sec_min = a
while a != 0:
    a = int(input())
    if a == 0:
        break
    elif a < minimum:
        sec_min = minimum
        minimum = a
    elif a > minimum and a < sec_min:
        sec_min = a
print(sec_min)

a=int(input())
 
while(True):
    b=int(input())
    if (b!=a):
        break
    
minimum=min(a,b)
sec_min=max(a,b)
 
while a != 0:
    a = int(input())
    if a == 0:
        break
    elif a < minimum:
        sec_min = minimum
        minimum = a
    elif a > minimum and a < sec_min:
        sec_min = a
print(sec_min)

a = int(input())
b = int(input())
if a < b:
    a, b = b, a
minimum = b
sec_min = a
while a != 0:
    if a < minimum:
        sec_min = minimum
        minimum = a
    elif a < sec_min:
        sec_min = a
    a = int(input())
print(sec_min)

c=[0 for _ in range(100)]
while(True):
    i=int(input())
    if i==0:
        break
    c[i-1]+=1
k=0
for i in range(100):
    if c[i] != 0:
        if k==1:
            print(i+1)
            break
        k+=1

numbers = []
 
while True:
    number = int(input())
    if number <= 100:
        numbers.append(number)
    if number == 0:
        break
print(sorted(numbers)[1])

print(sorted(numbers)[1])

print(__import__("heapq").nsmallest(2, {int(x) for x in iter(input, "0")})[-1])

a = []
while k := int(input()):
    a.append(k)
for i in range(a.count(min(a))):
    a.pop(a.index(min(a)))
print(min(a))