#include <iostream>
using namespace std;
const int MAX_LENGTH = 50000;
const int MAX_SIZE = 10000;
int main() {
int n, m, v[MAX_LENGTH + 1], w[MAX_SIZE + 1];
cin >> n;
int highVal = 0, posHighVal = 0;
for(int i = 1; i <= n; ++i ){
cin >> v[i];
if ( v[i] > highVal) {
highVal = v[i];
posHighVal = i + 1 ;
}
}
cout << highVal <<" " << posHighVal <<" \n";
cin >> m;
for(int i = 1; i <= m; ++i) {
cin >> w[i];
}
for (int j = 1; j <= m; ++j){
int stanga = 1, dreapta = posHighVal, midle;
while(stanga < dreapta) {
midle = (stanga + dreapta) / 2 ;
if(v[midle] < w[j]) {
stanga = midle + 1 ;
} else {
dreapta = midle;
}
if(dreapta == 1 && v[dreapta] > w[j]) {
stanga = posHighVal ;
dreapta = n;
// cout << stanga <<" " << dreapta <<" \n";
}
//cout << stanga <<" " << dreapta <<" \n";
}
if(v[stanga] == w[j]) {
cout << w[j] <<" se gaseste in sir\n";
} else {
cout << w[j] <<" nu se gaseste in sir\n";
}
}
/*
999999973 se gaseste in sir
999999873 nu se gaseste in sir
99999973 nu se gaseste in sir
999999973 se gaseste in sir
1 nu se gaseste in sir
100000000 nu se gaseste in sir
999999974 se gaseste in sir
99999961 nu se gaseste in sir
999999970 se gaseste in sir
999999975 se gaseste in sir
999999975 se gaseste in sir
999995975 nu se gaseste in sir
994999975 nu se gaseste in sir
999999979 se gaseste in sir
999999962 se gaseste in sir
1000001000 nu se gaseste in sir
999999996 se gaseste in sir
999999915 nu se gaseste in sir
999999952 se gaseste in sir
999995968 nu se gaseste in sir
999999963 se gaseste in sir
999999954 se gaseste in sir
99999995 nu se gaseste in sir
999999955 se gaseste in sir
999999967 se gaseste in sir
999999999 se gaseste in sir
999999993 se gaseste in sir
999999954 se gaseste in sir
3 nu se gaseste in sir
15 nu se gaseste in sir
1000000000 se gaseste in sir
2 nu se gaseste in sir
*/
// cout << 21 / 2;
return 0;
}