#include <bits/stdc++.h>

using namespace std;
ifstream fin("scmax.in")
ofstream fout("scmax.out")
const int MAX_N = 1 + 100000;
int N, a[MAX_N], indice[MAX_N], indice_anterior[MAX_N], solutie[MAX_N];
int lungime;
void read_imput()
{
    fin>>N;
    for(int i = 1;i <= N;i++)
        fin>>a[i];
}

int cauta_binar(int i)
{int stanga = 1, dreapta = N, sol = 0;
    while (stanga <= dreapta)
    {int mijloc = (stanga + dreapta)/2;
    if(a[i] > a[indice[mijloc])
        dreapta = N/2 - 1;
        else{stanga= n / 2 + 1;
        solutie = mijloc}
    }
}
int main()
{

    return 0;
}