#include "algorithm"
#include "array"
#include "cmath"
#include "complex"
#include "cstdio"
#include "deque"
#include "initializer_list"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "regex"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "vector"
#define FOR(i, n) for ((i) = 0; (i) < (n); ++(i))
#define in_int(x) scanf(" %d/n", &(x));
#define in_str(x) scanf(" %[a-zA-Z (+-0-9_) #.]/n", (x));
#define ch(x) printf("debug %d\n", (x))

int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, -1, 1};
int dx_ar[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy_ar[] = {1, 0, -1, 1, -1, 1, 0, -1};

template <typename type> void print_vector(type d1_arr);
template <typename type> void print_2darray(type d2_arr);
std::vector<std::vector<int>> padding(std::vector<std::vector<int>> arr,
                                      int pad);
inline std::vector<int> str_int_split(char *s);
inline std::vector<std::vector<int>> in_d2_arr(int N, int size = 1000);
inline std::vector<int> in_d1_arr(int size = 1000);
inline double d2_distance(int x1, int y1, int x2, int y2);
inline int d2_manhattan(int x1, int y1, int x2, int y2);

int main() {
  int N;
  in_int(N);
  auto v = in_d1_arr(1000000);

  std::sort(v.begin(), v.end());
  int n = v.back();
  int r = int(n / 2);
  auto itr = std::lower_bound(v.begin(), v.end(), r);
  int kouho1, kouho2;
  if (*itr != n) {
    kouho1 = *itr;
  } else {
    kouho1 = 1100000000;
  }

  if (itr-- != v.begin()) {
    kouho2 = *(itr--);
  } else {
    kouho2 = 1100000000;
  }



  int kouho;
  if (abs(r - kouho1) > abs(r - kouho2)) {
    kouho = kouho2;
  } else {
    kouho = kouho1;
  }
  printf("%d %d\n", n, kouho);
}

template <typename type> void print_vector(type d1_arr) {
  for (auto seg : d1_arr) {
    std::cout << seg;
    std::cout << " ";
  }
  std::cout << std::endl;
}

template <typename type> void print_2dvector(type d2_arr) {
  for (auto seg1 : d2_arr) {
    for (auto seg2 : seg1) {
      std::cout << seg2;
      std::cout << " ";
    }
    std::cout << std::endl;
  }
}

template <typename type> void print_map(type map) {
  for (auto m : map) {
    std::cout << m.first;
    std::cout << ":";
    std::cout << m.second;
    std::cout << " ";
  }
  std::cout << std::endl;
}

std::vector<std::vector<int>> padding(std::vector<std::vector<int>> arr,
                                      int pad) {
  std::vector<std::vector<int>> arr_c = arr;
  int height = arr_c.size();
  int width = arr_c[0].size();
  std::vector<int> v;
  v.resize(width);
  fill(v.begin(), v.end(), pad);
  arr_c.insert(arr_c.begin(), v);
  arr_c.push_back(v);
  int i;
  FOR(i, height + 2) {
    arr_c[i].insert(arr_c[i].begin(), pad);
    arr_c[i].resize(width + 2);
  }
  arr_c.shrink_to_fit();
  return arr_c;
}

inline std::vector<int> str_int_split(char *s) {
  char *tok = strtok(s, " ,");
  std::vector<int> v;
  while (tok != NULL) {
    v.push_back(atoi(tok));
    tok = strtok(NULL, " ,"); /* 2回目以降 */
  }
  return v;
}

inline std::vector<std::vector<int>> in_d2_arr(int N, int size) {
  int i;
  std::vector<std::vector<int>> v;
  FOR(i, N) {
    char *lines;
    lines = new char[size];
    in_str(lines);
    v.push_back(str_int_split(lines));
    delete[] lines;
  }
  return v;
}

inline std::vector<int> in_d1_arr(int size) {
  std::vector<int> v;
  char *lines;
  lines = new char[size];
  in_str(lines);
  v = str_int_split(lines);
  delete[] lines;
  return v;
}

inline double d2_distance(int x1, int y1, int x2, int y2) {
  return sqrt(pow((x2 - x1), 2) + pow((y2 - y1), 2));
}

inline int d2_manhattan(int x1, int y1, int x2, int y2) {
  return (abs(x2 - x1) + abs(y2 - y1));
}


Measured memory_bytes: 1916