#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
ll n;
vvl g(200010);
vector<priority_queue<ll>> dp(200010);
void dfs(ll v,ll par=-1){
  ll k=1,t=-1;
  for(auto p:g[v]){
    if(par==p)continue;
    dfs(p,v);
    if(chmax(k,(ll)dp[p].size()))t=p;
  }
  swap(dp[v],dp[t]);
  for(auto p:g[v]){
    if(par==p)continue;
    while(!dp[p].empty()){
      dp[v].push(dp[p].top());
      dp[p].pop();
    }
  }
  if(dp[v].size()>=2){
    ll sum=dp[v].top();dp[v].pop();
    sum+=dp[v].top();dp[v].pop();
    dp[v].push(sum);
  }
  if(dp[v].size()==0){
    dp[v].push(1);
  }
  else{
    ll x=dp[v].top();dp[v].pop();
    dp[v].push(x+1);
  }
}
int main(){
  cin >> n;
  rep(i,n-1){
    ll a,b;cin >> a >> b;a--;b--;
    g[a].emplace_back(b);
    g[b].emplace_back(a);
  }
  dfs(0);
  cout << dp[0].top() << endl;
}