#include <iostream>
using namespace std;

int main() {
	const int MAX_SIZE = 50000;
	const int MAX_LENGHT = 10000;
	int n, v[MAX_SIZE + 1];
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> v[i];
	}
	int i = 1, found = 1;
	while (i <= n && v[i] < v[i + 1]) {
		++found;
		++i;
	}
	int k, w[MAX_LENGHT + 1];
	cin >> k;
	for (int j = 1; j <= k; ++j) {
		cin >> w[j]; 
		int x = -1, left, right, middle;
		if (w[j] >= v[1]) { 
			left = 1, right = found + 1; 
		} else if (w[j] < v[1]) { 
			left = found + 1, right = n + 1; 
		}
		while (left < right) {  
			middle = (left + right) / 2;  
			if (v[middle] < w[j]) { 
				left = middle + 1; 
			} else {
				right = middle; 
			} 
			if (v[middle] == w[j]) { 
				x = w[j]; 
			}
		}
		if (x != -1) {
			cout << x << " " << "se gaseste in sir" << "\n";
		} else {
			cout << w[j] << " " << "nu se gaseste in sir" << "\n";
		}
	}
	return 0;
}