#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int v[10001],a[10001];
int main()
{int n,i,x,t,p,s,m,y;
fin>>n;
for (i=1;i<=n;i++) {fin>>v[i];
                    a[v[i]]++;}
fin>>m;
for (i=1;i<=m;i++) {fin>>x>>y;
                    if (x==0) {if (a[y]>=1) {t=upper_bound(v+1,v+n+1,y)-v;
                                             }
                                else if (a[y]==0) t=1;
                               fout<<t-1;}
                    if (x==1) {p=upper_bound(v+1,v+n+1,y)-v;
                               fout<<p-1;}
                    if (x==2) {p=lower_bound(v+1,v+n+1,y)-v;
                               fout<<p;}}


    return 0;
}