#include <iostream>
#include <fstream>

using namespace std;

int BinSearch (int arr[], int left, int right, int key)
{
	int mid = 0;
	while (true)
	{
    mid = (left + right) / 2;
    if (key < arr[mid])
	right = mid - 1;
	else if (key > arr[mid])
	left = mid + 1;
	else
	return mid;

	if (left > right)
	return -1;
 }
}

int main() {
	ifstream fin ("binsearch.in");
    ofstream fout ("binsearch.out");
   int n;
   fin >> n;
   int a[n];
   for (int i = 0; i < n; i++)
   fin >> a[i];

   int m;
   fin >> m;

   for (int i = 0; i < m; i++) {
   int tmp;
   fin >> tmp;
   fout << BinSearch(arr[], 0, m, tmp) << endl;
   }

fin.close();
fout.close();
return 0;

}