// 测试详情，多谢！

#include <bits/stdc++.h>
#define N 27

typedef long long ll;
using namespace std;

struct ticket {
	ll s; 
	int n; 
} a[N];
int m;

bool cmp(const ticket &a, const ticket &b) {
	if (a.s > b.s) return true;
	else return false;
}

int main(void) {
	scanf("%d", &m);
	for (int i = 1; i <= m; ++i) {
		scanf("%lld", &a[i].s);
		a[i].n = i;	
	} 
	sort(a + 1, a + m + 1, cmp);
	printf("%d\n%lld\n", a[1].n, a[1].s);
	return 0;
}

求助dalao中。。。