Buggy python submission (verdict: Time Limit Exceeded):
from math import factorial
n = int(input())
a_list = sorted(list(map(int, input().split())))

a_i_index = len(a_list) - 1
a_i = a_list[-1]
max = 0
max_j_index = None

nobori = True

tmp = a_list[0]
koeta = None
for j_index in range(n):
    if a_list[j_index] * 2 > a_i:
        koeta = j_index
        break
    else:
        tmp = j_index

comb = factorial(a_i) / (factorial(a_i - a_list[koeta]) * factorial(a_list[koeta]))
comb2 = 0
if koeta != 0:
    comb2 = factorial(a_i) / (factorial(a_i - a_list[koeta-1]) * factorial(a_list[koeta-1]))


if comb > comb2:
    print(*[a_i,a_list[koeta]])
else:
    print(*[a_i, a_list[koeta-1]])



Fixed submission:
n = int(input())
a_list = sorted(list(map(int, input().split())))
 
a_i_index = len(a_list) - 1
a_i = a_list[-1]
max = 0
max_j_index = None
 
nobori = True
 
tmp = a_list[0]
koeta = None
for j_index in range(n):
    if a_list[j_index] * 2 > a_i:
        koeta = j_index
        break
    else:
        tmp = j_index
 
comb2 = 0
if n == 2:
    print(*[a_list[1], a_list[0]])
elif koeta == 0:
    print(*[a_i, a_list[koeta]])
elif (a_list[koeta]- a_i/2) > (a_i/2 - a_list[koeta-1]):
    print(*[a_i,a_list[koeta-1]])
else:
    print(*[a_i, a_list[koeta]])

Buggy python submission (verdict: Time Limit Exceeded):
from math import factorial
n = int(input())
a_list = sorted(list(map(int, input().split())))

a_i_index = len(a_list) - 1
a_i = a_list[-1]
max = 0
max_j_index = None
for j_index in range(n):
    a_j = a_list[j_index]
    comb = factorial(a_i) / (factorial(a_i - a_j) * factorial(a_j))
    if comb > max:
        max = comb
        max_j_index = j_index
print(a_i, " ", a_list[max_j_index])


Fixed submission:
n = int(input())
a_list = sorted(list(map(int, input().split())))
 
a_i_index = len(a_list) - 1
a_i = a_list[-1]
max = 0
max_j_index = None
 
nobori = True
 
tmp = a_list[0]
koeta = None
for j_index in range(n):
    if a_list[j_index] * 2 > a_i:
        koeta = j_index
        break
    else:
        tmp = j_index
 
comb2 = 0
if n == 2:
    print(*[a_list[1], a_list[0]])
elif koeta == 0:
    print(*[a_i, a_list[koeta]])
elif (a_list[koeta]- a_i/2) > (a_i/2 - a_list[koeta-1]):
    print(*[a_i,a_list[koeta-1]])
else:
    print(*[a_i, a_list[koeta]])

Buggy python submission (verdict: Time Limit Exceeded):
from math import factorial
n = int(input())
a_list = sorted(list(map(int, input().split())))

a_i_index = len(a_list) - 1
a_i = a_list[-1]
max = 0
max_j_index = None
for j_index in range(n):
    a_j = a_list[j_index]
    comb = factorial(a_i) / (factorial(a_i - a_j) * factorial(a_j))
    if comb > max:
        max = comb
        max_j_index = j_index
print(a_i, " ", a_list[max_j_index])

Fixed submission:
n = int(input())
a_list = sorted(list(map(int, input().split())))
 
a_i_index = len(a_list) - 1
a_i = a_list[-1]
max = 0
max_j_index = None
 
nobori = True
 
tmp = a_list[0]
koeta = None
for j_index in range(n):
    if a_list[j_index] * 2 > a_i:
        koeta = j_index
        break
    else:
        tmp = j_index
 
comb2 = 0
if n == 2:
    print(*[a_list[1], a_list[0]])
elif koeta == 0:
    print(*[a_i, a_list[koeta]])
elif (a_list[koeta]- a_i/2) > (a_i/2 - a_list[koeta-1]):
    print(*[a_i,a_list[koeta-1]])
else:
    print(*[a_i, a_list[koeta]])