#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P) 
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }

const int MAX = 500;
const int INF = 1<<29;

map<string,int> ma;
int ndp[MAX][MAX];
int ddp[MAX][MAX];
int dp[MAX][MAX];

int N, M;

int main() {
    //freopen( "/Users/macuser/Dropbox/Contest/input.in", "r", stdin );
    
    while (cin >> N) {
        if (N == 0) break;
        ma.clear();
        for (int i = 0; i < MAX; ++i) for (int j = 0; j < MAX; ++j) ndp[i][j] = ddp[i][j] = dp[i][j] = INF;
        for (int i = 0; i < MAX; ++i) ndp[i][i] = ddp[i][i] = dp[i][i] = 0;
        
        vector<string> alt;
        int it = 0;
        for (int i = 0; i < N; ++i) {
            string str; cin >> str;
            for (int j = 0; j < str.size(); ++j) if (str[j] == '-') str[j] = ' ';
            istringstream sin(str);
            string sub1, sub2;
            sin >> sub1 >> sub2;
            
            if (!ma.count(sub1)) ma[sub1] = it++, alt.PB(sub1);
            if (!ma.count(sub2)) ma[sub2] = it++, alt.PB(sub2);
            
            ndp[ma[sub1]][ma[sub2]] = 1;
            ndp[ma[sub2]][ma[sub1]] = 1;
            ddp[ma[sub1]][ma[sub2]] = 1;
        }
        
        int n = it;
        for (int k = 0; k < n; ++k) for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) {
            chmin(ndp[i][j], ndp[i][k] + ndp[k][j]);
            chmin(ddp[i][j], ddp[i][k] + ddp[k][j]);
        }
        for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) {
            chmin(dp[i][j], ddp[i][j]);
            if (ndp[i][j] == 2 && ddp[i][j] >= INF && ddp[j][i] >= INF) dp[i][j] = 0;
        }
        for (int k = 0; k < n; ++k) for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) {
            chmin(dp[i][j], dp[i][k] + dp[k][j]);
        }
        
       // COUT(ma);
        for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) {
            //cout << alt[i] << ", " << alt[j] << " : " << ndp[i][j] << ", " << ddp[i][j] << ", " << dp[i][j] << endl;
        }
         
        cout << ma.size() << endl;
        cin >> M;
        for (int i = 0; i < M; ++i) {
            string str; cin >> str;
            for (int j = 0; j < str.size(); ++j) if (str[j] == '-') str[j] = ' ';
            istringstream sin(str);
            string sub1, sub2;
            sin >> sub1 >> sub2;
            
            if (!ma.count(sub1)) { puts("NO"); continue; }
            if (!ma.count(sub2)) { puts("NO"); continue; }
            int u = ma[sub1], v = ma[sub2];
            if (ndp[u][v] >= INF) puts("NO");
            else {
                if (ndp[u][v] % 2 == 0) puts("NO");
                else {
                    if (dp[u][v] < INF) puts("YES");
                    else puts("NO");
                }
            }
        }
    }
    return 0;
}


Measured memory_bytes: 4184