def pool(primes, wanted):

    for p in primes:
        if wanted % p == 0:
            b = wanted // p

            smaller = min(p, b)
            higher = max(p, b)
            print(smaller, higher)
            break


if __name__ == "__main__":
    wanted = int(input())
    n = int(input())

    primes = [int(x) for x in input().split()]

    pool(primes, wanted)