//#include "pch.h"
#include <iostream>
#include <fstream>
#include <vector>
#include <climits>
#include <algorithm>
#include <set>
#include <queue>
using namespace std;
ifstream f("cautbin.in");
ofstream o("cautbin.out");
int n;
vector<int>v;
int binary_Search(int value)
{
	int stanga, dreapta, mijloc;
	stanga = 0;
	dreapta = n - 1;
	if (v[dreapta] == value)
	{
		return dreapta;
	}

	while (stanga <= dreapta)
	{
		mijloc = stanga + (dreapta - stanga) / 2;


		if (v[mijloc + 1] > v[mijloc])
		{
			return mijloc + 1;
		}
		if (/*v[mijloc + 1] == v[mijloc] ||*/ value >= v[mijloc])
		{
			stanga = mijloc + 1;
		}
		else
		{
			dreapta = mijloc = 1;
		}
	}

	return -1;
}

int main()
{
	f >> n;
	for (size_t i = 1; i <= n; i++)
	{
		int x;
		f >> x;
		v.push_back(x);
	}
	int tests;

	f >> tests;

	while (tests--)
	{
		int type, value;
		f >> type >> value;
		switch (type)
		{
		case 0:
		{
			int poz = upper_bound(v.begin(), v.end(), value) - v.begin();
			if (v[poz - 1] == value)
			{
				o << poz << "\n";
			}
			else
			{
				o << "\n";
			}
		}
		break;
		case 1:
			o << upper_bound(v.begin(), v.end(), value) - v.begin() << "\n";
			break;
		case 2:
			o << lower_bound(v.begin(), v.end(), value) - v.begin() + 1 << "\n";
			break;

		}
	}


}