#include <iostream>

using namespace std;

int main()
{
    int a[200],i,j,k,l,n,c=0,ct=0,it,jt,temp;
    cin >>n;
    for(i=0;i<n;i++)
        cin >>a[i];

    //setting up max no of inversions in native array
    for(i=0;i<n-1;i++){
        for(j=i+1;j<n;j++){
            if(a[i]>a[j])
                ct++;
        }
    }
    it=n;jt=n;
    //brute force : trying for each permutation
    for(i=0;i<n-1;i++){
        c=0;
        for(j=i+1;j<n;j++){
            temp=a[i];a[i]=a[j];a[j]=temp;
            //swapping done. now getting invs
            c=0;
            for(k=0;k<n-1;k++){
                for(l=k+1;l<n;l++){
                    if(a[k]>a[l])
                        c++;
                }
            }
            if(c<=ct){
                ct=c;
                if(i<=it){
                    if(j<jt)
                        it=i;jt=j;
                }
            }
            //unswapping for further use
            temp=a[i];a[i]=a[j];a[j]=temp;
        }

    }
    cout << it+1<< " " << jt+1;
    return 0;
}