#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef double dl;

#define endl "\n"
#define vi vector<int>
#define mii map<int,int>
#define mci map<char,int>
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;

void solve(){
    int n;
    cin >> n ;

    map<string , int> mp;
    map<string , int> mp2;

    string s[n+10];

    for(int i = 0; i < n; i++){
        cin >> s[i];
        mp[s[i]]++;
    }

    int  k ;
    cin >> k;

    for(int i = 0; i < k; i++){
        string g;
        cin >> g;

        if(mp2[g]  > 0 && mp[g] > 0){
            cout << "Already inside!"  << endl;
        }
        else if( mp[g] == 0 ){
            cout << "Sorry, not on the list." << endl;
        }
        else{
            cout << "Welcome!" << endl;
        }
        mp2[g]++;
    }

}

int main()
{
    optimize();

    int t=1;
    //cin >> t;

    while(t--)  solve();

    return 0;
}