#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include<unordered_set>
#define ll long long
using namespace std;

int main() {
    ll m, i;
    cin>>m;
    string s;
    unordered_set<string> invited;
    for(i=0; i<m; i++){
        cin>>s;
        invited.insert(s);
    }
    ll n;
    cin>>n;
    string sn;
    unordered_set<string> inside;
    for(i=0; i<n; i++){
        cin>>sn;
        if(invited.find(sn) == invited.end()){
            cout<<"Sorry, not on the list."<<endl;
        }else if(invited.find(sn) != inside.end()){
            cout<<"Already inside!"<<endl;
        }else{
            inside.insert(sn);
            cout<<"Welcome"<<endl;
        }
    }
}