A and B are friends(direct or indirect), B and C are friends(direct or indirect), then A and C are also friends(indirect). In the first sample {1,2,5,6} is the result. In the second sample {1,2},{3,4},{5,6},{7,8} are four kinds of answers.

#include <iostream>

#include <cstring>

#include <algorithm>

#include <cstdio>

using namespace std;

const int MAX=;

int f[MAX],v[MAX];

int find(int n)

{

    if(n!=f[n])

    f[n]=find(f[n]);

    return f[n];

}

int main()

{  int n;

while(cin>>n)

{

    for(int i=;i<MAX;i++)

    {f[i]=i;v[i]=;}

    int a,b;

    int t=;

    for(int i=;i<n;i++)

    {scanf("%d%d",&a,&b);

     a=find(a);

     b=find(b);

     if(a!=b)

    {f[a]=b;v[b]+=v[a];t=max(t,v[b]);}

    }

   cout<<t<<endl;

}

return;

}