#include <iostream>
#include <queue>
#include <vector>
using namespace std;

int n;
vector<int> table[1005];
int boss[1005];
int find(int i,int j)
{
    int vis[1005] = {0};
    queue<int> bfs;
    vis[i] = 1;
    bfs.push(i);
    while(!bfs.empty())
    {
        vis[bfs.front()] = 1;
        for (auto k:table[bfs.front()])
        {
            if(k == j)
                return 1;
            if(vis[k])
                continue;


            bfs.push(k);
        }
        bfs.pop();
    }
    return 0;
}
int main()
{
    int t;
    cin >> t;
    for (int i = 0; i <= 1000; i++)
        boss[i] = i;
    while (t--)
    {
        int a, b;
        cin >> a >> b;
        if(find(a,b) ==1 )
        {
            cout << "Y\n";
        }
        else
        {
            cout << "N";
            table[a].push_back(b);
            table[b].push_back(a);
        }


    }
}