// Allah is the best planner.He knows everything
#include<bits/stdc++.h>
using namespace std;
 
//ordered set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef __gnu_pbds::tree<int, __gnu_pbds::null_type,
less<int>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> ordered_set;
 
#define pb  push_back
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define en "\n"
typedef long long int ll;
typedef unsigned long long int ull;
  
 
  
int main()
{
fast();
 
 int t=1; 
// cin>>t;
while(t--)
{
 ll n;
cin>>n;
vector<ll>arr(n);
map<string,ll>invited,inside;

 string str;
 for(int i=0;i<n;i++)
 {
    cin>>str;
    invited[str]++;
 }
 ll m;
 cin>>m;
 while(m--)
 {
    string temp;
    cin>>temp;
    if(invited[temp]>0&&inside[temp]<=0)
    {
        cout<<"Welcome!"<<en;
        inside[temp]++;
    }
    else if(inside[temp]>0)
    {
        cout<<"Already inside!"<<en;
    }
    else
    {
        cout<<"Sorry, not on the list."<<en;
    }
 }
}
   return 0;
}
//Not a good Coder->Rifat