#include<bits/stdc++.h>
using namespace std;
int n,v[100002];
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int cautbin3(int x)//daca ne-ar trebui o pozitie oarecare pe care se afla x
{
    int st=1,dr=n,mij;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(v[mij]==x)
            return mij;
        else
        if(v[mij]<x)
            st=mij+1;
        else
        if(x<v[mij])
            dr=mij-1;
    }
    return -1;
}

int cautbin0(int x)
{
    int st=1,dr=n,mij,poz=-1;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(v[mij]<x)
            st=mij+1;
        else
        if(x<v[mij])
            dr=mij-1;
        else
        if(v[mij]==x)
        {
            poz=max(poz,mij);//merge si doar poz=mij;
            st=mij+1;
        }
    }
    return poz;
}

int cautbin01(int x)
{
    int st=1,dr=n,mij;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(v[mij]<=x)
            st=mij+1;
        else
        if(x<v[mij])
            dr=mij-1;
    }
    if(v[st-1]==x)
        return st-1;
    return -1;
}


int cautbin1(int x)
{
    int st=1,dr=n,mij;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(v[mij]<=x)
            st=mij+1;
        else
        if(x<v[mij])
            dr=mij-1;
    }
    return st-1;//st-1==dr
}

int cautbin2(int x)
{
    int st=1,dr=n,mij;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(x<=v[mij])
            dr=mij-1;
        else
        if(v[mij]<x)
            st=mij+1;
    }
    return dr+1;//dr+1==st
}

int main()
{
    int i,m,p,x;
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>v[i];
    fin>>m;
    for(i=1;i<=m;i++)
    {
        fin>>p>>x;
        if(p==0)
            fout<<cautbin0(x);
        else
        if(p==1)
            fout<<cautbin1(x);
        else
        if(p==2)
            fout<<cautbin2(x);
        fout<<'\n';
    }
    return 0;
}