#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

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

int n;
int a[100010];
int m, cerinta, elem;
int check0(int poz, int x)
{
    for(int i=poz+1;i<=n;i++)
    {
        if(x == a[i])poz++;
    }
    return poz;
}

int cautbin0(int x)
{
    int s,d,mid;
    s=1;
    d=n;
    while(s<=d)
    {
        mid = (s+d)/2;
        if(a[mid]==x)return check0(mid, elem);
        if(a[mid]<x)s=mid++;
        else d=mid--;
    }
    return -1;

}

int check1(int poz, int x)
{
    int i;
    for(i=poz+1;i<=n;i++)
    {
        if(a[i]<=x)poz++;
    }
    return poz;
}

cautbin1(int x)
{
    int s,d,mid;
    s=1;
    d=n;
    while(s<=d)
    {
        mid = (s+d) /2;
        if(a[mid]<=x)return check1(mid, elem);
        if(a[mid]>x)d=mid--;
    }
    return -1;
}

int check2(int poz, int x)
{
    int i;
    for(i=poz-1;i>=1;i--)
    {
        if(a[i]>=x)poz--;
        else break;
    }
    return poz;
}

int cautbin2(int x)
{
    int s,d,mid;
    s=1;
    d=n;
    while(s<=d)
    {
        mid = (s+d) /2;
        if(a[mid]>=x)return check2(mid, elem);
        if(a[mid]<x)s=mid++;
    }
    return -1;
}

void read()
{
    f>>n;
    for(int i=1;i<=n;i++)
    {
        f>>a[i];
    }
    f>>m;
    for(int i=1;i<=m;i++)
    {
        f>>cerinta>>elem;
        if(cerinta == 0)g<<cautbin0(elem)<<"\n";
        if(cerinta == 1)g<<cautbin1(elem)<<"\n";
        if(cerinta == 2)g<<cautbin2(elem)<<"\n";
    }
}

int main()
{
    read();

      return 0;
}