#include <bits/stdc++.h>
using namespace std;
int binary(int b[],int s,int key)
{
int l=0,h=s;
while(l<=h)
{
int mid=l+(h-l)/2;
if(b[mid]==key)
return mid;
if(b[mid]>key)
h=mid-1;
else if(key>b[mid])
l=mid+1;
}
return -1;
}
int main() {
// your code goes here
int n;
cin>>n;
int a[n],b[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)b[i]=a[i];
sort(&a[0],&a[n]);
int s=a[0];
int st=a[n-1];
int smallest=binary(a,sizeof(a)/sizeof(a[0]),s);
int largest=binary(a,sizeof(a)/sizeof(a[0]),st);
cout<<smallest<<" "<<largest;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBiaW5hcnkoaW50IGJbXSxpbnQgcyxpbnQga2V5KQp7CiAgaW50IGw9MCxoPXM7CiAgd2hpbGUobDw9aCkKICB7CiAgCWludCBtaWQ9bCsoaC1sKS8yOwogIAlpZihiW21pZF09PWtleSkKICAJcmV0dXJuIG1pZDsKICAJaWYoYlttaWRdPmtleSkKICAJaD1taWQtMTsKICAJZWxzZSBpZihrZXk+YlttaWRdKQogIAlsPW1pZCsxOwogIH0KICByZXR1cm4gLTE7Cn0KaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgbjsKCWNpbj4+bjsKCWludCBhW25dLGJbbl07Cglmb3IoaW50IGk9MDtpPG47aSsrKWNpbj4+YVtpXTsKCWZvcihpbnQgaT0wO2k8bjtpKyspYltpXT1hW2ldOwoJc29ydCgmYVswXSwmYVtuXSk7CglpbnQgcz1hWzBdOwoJaW50IHN0PWFbbi0xXTsKCWludCBzbWFsbGVzdD1iaW5hcnkoYSxzaXplb2YoYSkvc2l6ZW9mKGFbMF0pLHMpOwoJaW50IGxhcmdlc3Q9YmluYXJ5KGEsc2l6ZW9mKGEpL3NpemVvZihhWzBdKSxzdCk7Cgljb3V0PDxzbWFsbGVzdDw8IiAiPDxsYXJnZXN0OwoJcmV0dXJuIDA7Cn0=