#include <bits/stdc++.h>
void bubble_sort(long[], long);
int main() {
  long array[100005], n, c, d, swap;
  scanf("%ld", &n);
  for (c = 0; c < n; c++) scanf("%ld", &array[c]);
  int max = 0, maxval = 0;
  for (c = 0; c < n; c++) {
    if (array[c] > max) {
      max = array[c];
      maxval = c;
    }
  }
  printf("%d", maxval + 1);
  bubble_sort(array, n);
  printf("% ld", array[n - 2]);
  return 0;
}
void bubble_sort(long list[], long n) {
  long c, d, t;
  for (c = 0; c < (n - 1); c++) {
    for (d = 0; d < n - c - 1; d++) {
      if (list[d] > list[d + 1]) {
        t = list[d];
        list[d] = list[d + 1];
        list[d + 1] = t;
      }
    }
  }
}
