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

const int N = 112345;
int p[N], w[N];

void init() {
    for (int i = 0; i < N; i++) {
        w[p[i] = i] = 1;
    }
}

int find(int a) {
    return (p[a] == a) ? a : (p[a] = find(p[a]));
}

void join(int a, int b) {
    if ((a = find(a)) == (b = find(b))) return;
    if (w[a] < w[b]) swap(a, b);
    w[a] += w[b];
    p[b] = a;
}

int main() {
    int n; scanf("%d", &n);
    init();
    for (int i = 0; i < n; i++) {
        int p, q; scanf("%d %d", &p, &q); p--; q--;
        if (find(p) == find(q)) {
            printf("Y\n");
        } else {
            printf("N\n");
            join(p, q);
        }
    }
}