#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int main()
{
    int n,k,a,b,i;
    fin>>n;
    vector<int> x(n);
    for(auto &elem:x) fin>>elem;
    fin>>k;

    for(i=1;i<=k;i++)
    {
        fin>>a>>b;
        if(a==0)
        {
            if(binary_search(x.begin(),x.end(),b))
            {
                auto z=upper_bound(x.begin(),x.end(),b);
                fout<<z-x.begin()<<"\n";
            }
            else fout<<"-1"<<"\n";
        }

        if(a==1)
        {
            auto z=upper_bound(x.begin(),x.end(),b);
            fout<<z-x.begin()<<"\n";
        }
        if(a==2)
        {
            auto z=lower_bound(x.begin(),x.end(),b);
            fout<<z-x.begin()+1<<"\n";
        }
    }


}