蒟蒻求救！！！！！！！SOS P宇宙总统

#include<iostream>
#include<fstream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
int n;
int a[1000005],b[1000005],maxs;
bool cmp(int a,int b)
{
	return a>b;
}
int main()
{
  cin>>n;
  for(int i=1;i<=n;i++){cin>>a[i];b[i]=a[i];}
  sort(a+1,a+1+n,cmp);
  maxs=a[1];
  for(int i=1;i<=n;i++)
  {
  	if(b[i]==maxs){cout<<i<<endl<<b[i];return 0;}
  }
  return 0;
}