#include <iostream>
#include <fstream>

using namespace std;

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

	int BinSearchLeft (int arr[], int right, int key)
{
	int left = -1;
	int mid = 0;
	while (right - left > 1) {
    mid = (left + right) / 2;
    if (key > arr[mid]) {
	left = mid;
}	else {
	right = mid;
}
}
	if (arr[right] == key & right!=0) {
	return right + 1;
	}
	else {
	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 << BinSearchLeft(a, n, tmp) << BinSearchRight(a, n, tmp) << endl;
   }

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

}