#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");

deque <int> v;

int n,i,a[500010],x,Max;

int main()
{
    f>>n;
    for (i=1;i<=n;i++)
        f>>a[i];

    for (i=1;i<=n;i++)
    {
        x=a[i];
        while (!v.empty() && a[v.back()]>=x) v.pop_back();
        v.push_back(i);

        if (i-v.front()>=k) v.pop_front();
        if (i>=k)
        {
         x=a[v.front()];
         if (x>Max)

         {
             Max=x;
             u=i;
             p=u-k+1;
         }
        }
    }

    g<<p<<" "<<u<<" "<<Max;

    return 0;
}