#include <cstdio>

 #include <cstring>

 #include <cstdlib>

 #include <algorithm>

 #include <vector>

 using namespace std;

 const int MAXN = ;

 vector<int> adj[MAXN];

 bool vis[MAXN][];

 int d[MAXN][];

 int n, m;

 //int path[MAXN][2];

 //int fang[MAXN];

 int dp( int i, int j, int f )

 {

     if ( vis[i][j] ) return d[i][j];

     vis[i][j] = true;

     int &ans = d[i][j];

     ans = ;

     for ( int k = ; k < (int)adj[i].size(); ++k )

     if ( adj[i][k] != f ) ans += dp( adj[i][k], , i );

     //path[i][j] = f;

     if ( j || f <  )

     {

         int sum = ;

         for ( int k = ; k < (int)adj[i].size(); ++k )

         if ( adj[i][k] != f )

            sum += dp( adj[i][k], , i );

         if ( sum < ans )

         {

             ans = sum;

             //path[i][j] = -f;

         }

     }

     return ans;

 }

 //void DFS( int i, int j, int f )

 //{

 //    if ( fang[i] != -1 ) return;

 //    if ( !path[i][j] || path[i][j] == f )

 //    {

 //        if ( f >= 0 ) fang[f] = j;

 //        for ( int k = 0; k < (int)adj[i].size(); ++k )

 //            if ( adj[i][k] != f ) DFS( adj[i][k], 1, i );

 //    }

 //    else

 //    {

 //        if ( f >= 0 ) fang[f] = j;

 //        for ( int k = 0; k < (int)adj[i].size(); ++k )

 //            if ( adj[i][k] != f ) DFS( adj[i][k], 0, i );

 //

 //    }

 //    return;

 //}

 int main()

 {

     while ( ~scanf( "%d", &n ) )

     {

         m = n - ;

         for ( int i = ; i <= n; ++i ) adj[i].clear();

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

         {

             int a, b;

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

             adj[a].push_back(b);

             adj[b].push_back(a);

         }

         memset( vis, false, sizeof(vis) );

         //memset( fang, -1, sizeof(fang) );

         //memset( path, 0, sizeof(path) );

         int ans = dp( , , - );

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

     }

     return ;

 }