ll parent[200000 + 10], siz[200000 + 10];

ll findParent(ll i)
{
    if (i == parent[i])
        return i;
     
     parent[i] = findParent(parent[i]);
      return parent[i];
}

void unionNodes(ll a, ll b)
{
    ll parent_a = findParent(a), parent_b = findParent(b);
    if (parent_a == parent_b)
        return;
    if (siz[parent_a] >= siz[parent_b]) {
        swap(parent_a, parent_b);
    }
    siz[parent_b] += siz[parent_a];
    parent[parent_a] = parent_b;
}

void cleardsu(ll n) {
    for (ll i = 0; i <= n; i++) {
        parent[i] = i;
        siz[i] = 1;
    }
}

if(something1 || something2)
{
  if(something1 && something2)
  {

  }
  else
  {
  	if(something1)
  	{

  	}
  	else
  	{
  		
  	}
  }
}
else
{

}

//idk comment if you know any easy way to handle this

#define fo(a,b) for(int i=a;i<b;i++)

for(int i=0;i<b && j<something;i++)

//what if we get directly for loop printed instead of #define so we can edit it later

if(something1 || something2)
{
  if(something1 && something2)
  {

  }
  else
  {
  	if(something1)
  	{

  	}
  	else
  	{
  		
  	}
  }
}
else
{

}