#include <iostream>
#include <cstdio>
using namespace std;

const int maxn=10000005;
int f[maxn],v[maxn];

int findset(int x) { return f[x]!=x?f[x]=findset(f[x]):f[x];}//带路径压缩

void merge(int a,int b)
{
    int fa=findset(a);
    int fb=findset(b);
    if(fa!=fb) f[fa]=fb;
}

int main()
{
    int n,a,b,i,ans;
    while(~scanf("%d",&n))
    {
        ans=0;
        for(i=1;i<=10000000;i++) f[i]=i,v[i]=0;
        while(n--)
        {
            scanf("%d %d",&a,&b);
            merge(a,b);        
        }
        for(i=1;i<=10000000;i++) v[findset(f[i])]++;
        for(i=1;i<=10000000;i++) ans=ans>v[i]?ans:v[i];
        printf("%d\n",ans);
    }
    return 0;
}