#include <bits/stdc++.h>
class UnionFind {
    std::vector<int> arr;

   public:
    UnionFind(int n) {
        arr.assign(n, -1);
    }
    int root(int a) {
        if (arr[a] < 0) return a;
        arr[a] = root(arr[a]);
        return arr[a];
    }
    bool merge(int u, int v) {
        u = root(u);
        v = root(v);
        if (u == v) return false;
        if (-arr[u] < arr[v]) {
            std::swap(u, v);
        }
        arr[u] += arr[v];
        arr[v] = u;
        return true;
    }
    bool same(int u, int v) {
        return root(u) == root(v);
    }
    int size(int u) {
        return -arr[root(u)];
    }
};

using namespace std;
int main() {
    int n;
    cin >> n;
    UnionFind uf(1000);
    while (n--) {
        int p, q;
        cin >> p >> q;
        if (uf.merge(p, q)) {
            cout << "N" << endl;
        } else {
            cout << "Y" << endl;
        }
    }
}