//023.001插入排序 
#include <bits/stdc++.h>
/*
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <aigorithm>
*/
using namespace std;
const int MAXN=10001;
int main()
{
	int n,i,j,k,max;
	float temp,a[MAXN],b[MAXN];
	cin>>n;
	for (i=0;i<n;i++) cin>>a[i];
	for (i=0;i<n;i++)
	{
		for (j=i-1;j>=0;j--)
		{
			if (a[j]<a[i]) break;
		}
		if (j!=i-1)
		{
			temp=a[i];
			for (k=i-1;k>j;k--) a[k+1]=a[k];
			a[k+1]=temp;
		}
	}
	for (i=0;i<n;i++) b[i]=a[i];
	for (i=0;i<n;i++) if (a[n-1]==b[i]) max=i;
	cout<<max<<endl<<fixed<<setprecision(0)<<b[max];
	return 0;
}