#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cstring>
#include<map>
using namespace std;
typedef long long LL;
const int N=2e5+10;
int n,T;
int ans;
int p[1100];
int find(int x){
    if(p[x]!=x)return p[x]=find(p[x]);
}
int main()
{
    T=1;
    while(T--){
        ans=0;
        cin>>n;
        for(int i=0;i<=1000;i++)p[i]=i;
        for(int i=1;i<=n;i++){
            int a,b;
            cin>>a>>b;
            int pa=find(a),pb=find(b);
            if(pa!=pb){
                puts("N");
                p[pa]=pb;
            }else puts("Y");
        }
       // cout<<ans<<endl;
    }

    return 0;
}