#include <bits/stdc++.h>
using namespace std;
int x[100007], n, dem = 1, j, i, p, q;
int gcd (int a, int b)
{
while (b != 0)
{
int r = a % b ; a = b ; b = r;
}
return a;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for (int i = 0 ; i < n ; i ++)
{
cin >> x[i];
}
for (int i = 0 ; i < n ; i = j + 1)
{
for (j = i ; j < n && gcd(x[j + 1], x[j]) == min (x[j + 1], x[j]) ; j ++);
if (j - i + 1 > dem) {dem = j - i + 1 ; p = i + 1 ; q = j + 1;}
}
cout << p << " " << q;
}
/*
ai < ai + 1 < ... < aj;
int max = 0
for (int i = 0 ; i < n ; i = j + 1)
{
for (j = i ; j < n && a[j] < a[j+1] ; j ++);
if (j-i+1>max) max = j - i + 1;
}
*/
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IHhbMTAwMDA3XSwgbiwgZGVtID0gMSwgaiwgaSwgcCwgcTsKCmludCBnY2QgKGludCBhLCBpbnQgYikKewogICAgd2hpbGUgKGIgIT0gMCkKICAgIHsKICAgICAgICBpbnQgciA9IGEgJSBiIDsgYSA9IGIgOyBiID0gcjsKICAgIH0KICAgIHJldHVybiBhOwp9CgppbnQgbWFpbigpCnsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luLnRpZShudWxscHRyKTsKICAgIGNpbiA+PiBuOwogICAgZm9yIChpbnQgaSA9IDAgOyBpIDwgbiA7IGkgKyspCiAgICB7CiAgICAgICAgY2luID4+IHhbaV07CiAgICB9CiAgICBmb3IgKGludCBpID0gMCA7IGkgPCBuIDsgaSA9IGogKyAxKQogICAgewogICAgICAgIGZvciAoaiA9IGkgOyBqIDwgbiAmJiBnY2QoeFtqICsgMV0sIHhbal0pID09IG1pbiAoeFtqICsgMV0sIHhbal0pIDsgaiArKyk7CiAgICAgICAgaWYgIChqIC0gaSArIDEgPiBkZW0pIHtkZW0gPSBqIC0gaSArIDEgOyBwID0gaSArIDEgOyBxID0gaiArIDE7fQogICAgfQogICAgY291dCA8PCBwIDw8ICIgIiA8PCBxOwp9Ci8qCiBhaSA8IGFpICsgMSA8IC4uLiA8IGFqOwppbnQgbWF4ID0gMApmb3IgKGludCBpID0gMCA7IGkgPCBuIDsgaSA9IGogKyAxKQp7CiAgICBmb3IgKGogPSBpIDsgaiA8IG4gJiYgYVtqXSA8IGFbaisxXSA7IGogKyspOwogICAgaWYgKGotaSsxPm1heCkgbWF4ID0gaiAtIGkgKyAxOwp9CiovCg==