#include<bits/stdc++.h>
using namespace std;
const int N = 10005;
int dsu[N];
int Find(int x){
    if(dsu[x] < 0)
        return x;
    return dsu[x] = Find(dsu[x]);
}

bool Union(int x, int y){
    x = Find(x);
    y = Find(y);
    if(x == y){
        return 0;
    }
    if(dsu[x] > dsu[y]){
        swap(x, y);
    }
    dsu[x] += dsu[y];
    dsu[y] = x;
    return 1;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        dsu[i] = -1;
    }

    int u, v;
    for(int i = 1; i <= n; i++){
        cin >> u >> v;
        if(Union(u, v)){
            cout << "N\n";
        }else{
            cout << "Y\n";
        }
    }
}