/*
 *   BISMILLAHIR RAHMANIR RAHIM
 *   ==========================
 *
 *   Submitted By: SAKLAN
 *   North East University Bangladesh
 */

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

#define int long long
#define ll long long
#define ld long double
#define cinv(v) for(auto &i:v) cin >> i;
#define vi vector<int>
#define vii vector<ll>
#define MOD 1000000007
#define coutv(v) for(auto e:v) cout << e << ' ';
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define mem(a,b) memset(a, b, sizeof(a) )
#define sqr(a) ((a) * (a))
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define endl '\n'
#define saklan ios::sync_with_stdio(0); cin.tie(0);

ll gcd ( ll a, ll b ) { return __gcd ( a, b ); }
ll lcm ( ll a, ll b ) { return a * ( b / gcd ( a, b ) ); }



void solve(){
    int t = 1;
    //cin >>  t;
    while(t--){
        int n;cin>>n;
        vector<string>s(n);
        for(int i = 0; i < n; i++){
            cin>>s[i];
        }


//        for(int i = 0; i < n; i++){
//            cout << s[i] << endl;
//        }


        set<string>st(s.begin(),s.end());
        int m;cin>>m;
        set<string>add;
        while(m--){
            string temp;cin>>temp;
            if(st.find(temp) != st.end()){
                if(add.find(temp) != add.end()){
                    cout << "Already inside!" << endl;
                }else{
                    cout << "Welcome!" <<endl;
                }

            }else{
                cout << "Sorry, not on the list." << endl;
            }
            add.insert(temp);
        }





//        vector<pair<string,int>>st;
//
//        for(int i = 0; i < m; i++){
//
//        }
    }
}




int32_t main() {
    saklan
    solve();

    return 0;
}