#include<bits/stdc++.h>
using namespace std;
class DisjointSets{
int n;
vector<int> parent;//array[] is declared as parent[].
vector<int> Size;
public:
    DisjointSets(int n){
        this->n=n;
        for(int i=0;i<n;i++){
            parent.push_back(i);
            Size.push_back(1);
        }
    }
    void WeightedUnion(int a,int b){
        int root_A=root(a);
        int root_B=root(b);
        if(Size[root_A]>Size[root_B]){
            parent[root_B]=parent[root_A];
            Size[root_A]+=Size[root_B];
        }else if(Size[root_A]<Size[root_B]){
            parent[root_A]=parent[root_B];
            Size[root_B]+=Size[root_A];
        }else{
            parent[root_B]=parent[root_A];
            Size[root_A]+=Size[root_B];
        }
    }
    int root(int x){
        if(parent[x]!=x){
            return root(parent[x]);
        }
        return x;
    }
    int find_set(int x){
        if(parent[x]!=x){
            parent[x]=find_set(parent[x]);
        }
        return parent[x];
    }
};
int main(){
    DisjointSets obj(5);
    obj.WeightedUnion(0,2);
    obj.WeightedUnion(4,2);
    obj.WeightedUnion(3,1);
    if(obj.find_set(4)==obj.find_set(0)){
        cout<<"Yes"<<endl;
    }else{
        cout<<"No"<<endl;
    }
    if(obj.find_set(1)==obj.find_set(0)){
        cout<<"Yes"<<endl;
    }else{
        cout<<"No"<<endl;
    }
    return 0;
}