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

int gcd(int x, int y) { //求最大公约数
	return y == 0 ? x : gcd(y, x % y); 
}
int main() {
    int n;
    while (cin >> n) {
        vector<int> a(n);
        for (int i = 0; i < n; i++) 
			cin >> a[i];
		int maxc=a[0],minc=a[0];
        for (int i = 0; i < n; i++) {
        	if(a[i] > maxc)
				maxc = a[i];
			else if(a[i] < minc)
				minc = a[i];
        }
        cout << minc <<" "<< maxc <<" "<< gcd(minc,maxc) << endl;
    }
    return 0;
}