#include<iostream>

#include<cstdio>

#include<cstring>

#include<queue>

#include<algorithm>

#include<map>

using namespace std;

#define N 200005

int father[N];

int number[N];

int findFa(int num)

{

    if(father[num]!=num)

        father[num]=findFa(father[num]);

    return father[num];

}

void Merge(int a,int b)

{

    int fa=findFa(a);

    int fb=findFa(b);

    if(fa!=fb)

    {

        father[fa]=fb;

        number[fb]+=number[fa];

    }

}

map<int,int> ma;

int size;

int main()

{

    int n;

    while(scanf("%d",&n)!=EOF)

    {

        size=;

        ma.clear();

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

        {

            father[i]=i;

            number[i]=;

        }

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

        {

            int a,b;

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

            if(ma[a]==)

                ma[a]=size++;

            if(ma[b]==)

                ma[b]=size++;

            Merge(ma[a],ma[b]);

        }

        int res=;

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

        {

            //if(i<10)

            //  cout<<number[i]<<" ";

            if(father[i]==i)

                res=max(res,number[i]);

        }

        printf("%d\n",res);

    }

    return ;

}