# def binarySearch(mas, elem):
#     a, b = -1, len(mas)
#     while b-a != 1:
#         middle = (a+b) // 2
#
#         if mas[middle] > elem:
#             b = middle
#         else:
#             a = middle
#
#     return b
#
#
n = int(input())
l = int(input())
mas = sorted(list(map(int, input().split())))
mas_set = set(mas)
for i in range(l):
    if n % mas[i] != 0:
        continue

    number = n // mas[i]
    if number == mas[i]:
        continue

    if number in mas_set:
        print(min(mas[i], number), max(mas[i], number))
        exit()