#include<bits/stdc++.h>

using namespace std;

typedef struct

{

    int n;

    int add;

}node;

node a[];

int m[][];

bool cmp (node a,node b)

{

    return a.n>b.n;

}

int main()

{

    int n,i;

    cin>>n;

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

    {

        a[i].add=i;

    }

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

    {

        int x,y;

        cin>>x>>y;

        m[x][y]=;

        a[x].n++;

    }

    sort(a+,a+n+,cmp);

    node n1=a[];

    node n2=a[];

    int anss=n1.n+n2.n+;

    if(n1.add==||n2.add==)

    anss--;

    if(m[n1.add][n2.add])

    anss--;

    cout<<anss<<endl;

    return ;

}