#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int>> adj;
vector<int> parent;
vector<int> Rank;
int n=4;
void addEdge(int i, int j)
{
    adj.push_back(make_pair(i,j));
}
void makeSet()
{
    parent.resize(n);
    Rank.resize(n);
    for(int i=0; i<n; i++)
    {
        parent[i]=-1;
        Rank[i]=1;
    }
}
int find(int i)
{
    if(parent[i]==-1) return i;
    else return parent[i]=find(parent[i]);
}
void Union(int i, int j)
{
    int s1 = find(i);
    int s2 = find(j);
    if(s1!=s2)
    {
        if(Rank[s1]<Rank[s2])
        {
            parent[s1]=s2;
            Rank[s2]+=Rank[s1];
        }
        else 
        {
            parent[s2]=s1;
            Rank[s1]+=Rank[s2];
        }
    }
}
bool detectCycle()
{
    makeSet();
    for(auto edge:adj)
    {
        int i=edge.first;
        int j=edge.second;
        int s1=find(i);
        int s2=find(j);
        if(s1!=s2) Union(i,j);
        else {
            cout<<"Cycle detected"<<endl;
            cout<<"Their parent are "<<s1<<" "<<s2<<endl;
            return true;
        }
    }
    return false;
}
int main()
{
    addEdge(0,1);
 addEdge(1,2);
 addEdge(2,3);
 addEdge(3,0);
    cout<<detectCycle()<<endl;
   // for(auto i:Rank) cout<<i<<" ";
    for(int i=0; i<n; i++)
    {
        if(parent[i]==-1) cout<<"Representative "<<i<<" Total size "<<Rank[i]<<endl;
    }
    cout<<endl;
    cout<<count(parent.begin(), parent.end(), -1)<<endl;
}