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

using namespace std;



int main()
{
	vector<pair<int, int>> v;
	int n, t;
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> t;
		v.push_back({ t, i });
	}
	sort(v.begin(), v.end());
	int maxi = 0, res = -1, ind = -1, kezd = -1;
	for (auto& e : v)
	{
		if (e.second > maxi)
			maxi = e.second;
		else if (maxi - e.second > res)
		{
			res = maxi - e.second;
			kezd = e.second;
			ind = maxi;
		}
	}
	if (kezd == -1)
		cout << -1;
	else
		cout << kezd << " " << ind;
}