num_of_prices = int(input())
lst = [int(x) for x in input().split(" ")]
second_max = lst[1]
current_max_index = 0
for i in range(1, num_of_prices):
if lst[current_max_index] < lst[i]:
second_max = lst[current_max_index]
current_max_index = i
elif lst[i] > second_max:
second_max = lst[i]
print(current_max_index+1, second_max)#include<bits/stdc++.h>
#define ll long long
typedef unsigned long long ull;
#define PI 3.141592653589793238462
#define eps 0.00001
#define ld long double
ll mod = pow(10,9)+7;
using namespace std;
///////////////////////////////////////////////////////////////////////
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t=1;
// cin>>t;
while(t--){
ll n; cin>>n;
vector<ll>v(n);
for(ll i=0; i<n; i++){
cin>>v[i];
}
auto it = max_element(v.begin(),v.end());
ll ind = it-v.begin()+1;
sort(v.begin(),v.end());
cout<<ind<<" "<<v[n-2]<<endl;
}
return 0;
}
274. H-Index | 260. Single Number III |
240. Search a 2D Matrix II | 238. Product of Array Except Self |
229. Majority Element II | 222. Count Complete Tree Nodes |
215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |