#include <bits/stdc++.h>
using namespace std;

int main() {
	long long vals[200005];
	set<long long> tmp;
	long long val;
	cin >> val;
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> vals[i];
		tmp.insert(vals[i]);
	}
	long long a = 0;
	long long b = 0;
	for (int i = 0; i < n; i++) {
		if (val % vals[i] != 0) {
			continue;
		}
		long long x = val / vals[i];
		if (x != val && tmp.count(x) != 0) {
			a = min(vals[i], x);
			b = max(vals[i], x);
			break;
		}
	}
	cout << a << " " << b << endl;
	return 0;
}