vijos-p1237 || China University of Petrolenum 1363

//vijos-p1237 || China University of Petrolenum 1363
//AC by warteac
//2013-7-19
//DP，分子/分母，排序，不断根据计算结果再增大分子或者分母，并且最终的结果是最小的
//Memory	Time	Language	Code Length	     Submit Time
//1400          24      C++/Edit	 1070 B	          2013-07-19 13:55:16
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
const double gold = 0.6180339887498949;
vector <int> w;
int Lwing,Rwing;

double ratio(int x, int y){
    double a = x;
    double b = y;
    return a/b;
}
bool cmp(int a, int b){
    return a < b;
}
void computing(){
    Lwing = w[0];
    Rwing = w[1];
    for(int i = 0, j = 1; i < w.size()-1 && j < w.size();){
        double t = ratio(w[i],w[j]);
        double d = ratio(Lwing,Rwing);
        if(fabs(t - gold) < fabs(d - gold)){//更接近黄金比，更新
            Lwing = w[i]; Rwing = w[j];
        }else if(t < gold){ //如果小于黄金比，增大分子
            i++;
        }else if(t > gold){//如果大于黄金比，增大分母
            j++;
        }else{//恰好等于黄金比，结束
            break;
        }
    }
}
int main(){
    int n,m;
    cin >> n;
    while(n--){
        cin >> m;
        w.push_back(m);
    }
    sort(w.begin(),w.end(),cmp);
    computing();
    cout << Lwing << endl;
    cout << Rwing << endl;
    return 0;
}