#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> v(n);

    for (int i = 0; i < n; i++)
    {
        cin >> v[i];
    }
    vector<int> s = v;
    sort(s.begin(), s.end());

    for (int i = n - 1; i >= 0; i--)
    {
        if (s[i] == v[i])
        {
            v.pop_back();
        }
        else
        {
            break;
        }
    }

    for (int i = 0; i < v.size(); i++)
    {
        if (s[i] == v[0])
        {
            v.erase(v.begin());
        }
        else
        {
            break;
        }
    }

    int b = -1, e = -1;
    int maxLength = 0;
    int maxi = -1;
    for (int i = 0; i < n - maxLength - 1; i++)
    {
        if (v[i] < maxi)
        {
            continue;
        }
        for (int j = n - 1; j > i + maxLength; j--)
        {
            if (v[i] > v[j])
            {
                if (j - i > e - b)
                {
                    b = i + 1;
                    e = j + 1;
                    maxLength = e - b;
                    break;
                }

            }
        }
        maxi = max(maxi, v[i]);
    }
    if (e != -1)
    {
        cout << b << " " << e;
    }
    else
    {
        cout << -1;
    }
}