#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];
    }
    for (int i = n - 1; i >= 0; i--)
    {
        if (i + 1 == v[i])
        {
            v.pop_back();
        }
        else
        {
            break;
        }
    }

    int end = v.size();
    int lmaxi = 0;
    int lpos = -1;
    for (int i = 0; i < end; i++)
    {
        if (v[i] > lmaxi)
        {
            lpos = i;
            lmaxi = v[i];
        }
    }
    int b = -1, e = -1;
    int maxLength = 0;
    if (lpos != -1)
    {
        b = lpos + 1;
        e = end;
        maxLength = e - b;
    }
    
    int maxi = -1;
    
    bool pastSorted = false;
    for (int i = 0; i < end - maxLength - 1; i++)
    {
        if (v[i] < maxi)
        {
            continue;
        }
        if (!pastSorted)
        {
            if (v[i] == i + 1)
            {
                continue;
            }
            else
            {
                pastSorted = true;
            }
        }
        for (int j = end - 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;
    }
}