#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using OrderedSet = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define v vector
#define int long long
#define vin vector <int>
#define pii pair <int, int>
#define all(a) a.begin(), a.end()
#define yes cout << "YES\n"
#define Yes cout << "Yes\n"
#define no cout << "NO\n"
#define No cout << "No\n"
#define rep(i, a, b) for(int i = a; i < b; i++)
#define repn(i, a, b) for(int i = a; i <= b; i++)
#define rev(i, a, b) for(int i = a; i >= b; i--)
int mod = 998244353;

void fastIO(){
   ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
}

void pk() {
    int n; cin >> n;
    map<string, int> s;
    rep(i, 0, n) {
        string x; cin >> x;
        s[x]=-1;
    }
    cin >> n;
    rep(i, 0, n) {
        string x; cin >> x;
        if(s[x] == -1){
            cout <<"Welcome!\n";
            s[x] = 1;
        }
        else if(s[x] == 1){
            cout <<"Already inside!\n";
        } else cout << "Sorry, not on the list.\n";
    }
}

int32_t main(){
    fastIO();
    int t = 1;
    // cin >> t;
    while(t--) pk();
    return 0;
}