#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000

int n;
vector<vector<int>> E;
vector<int> dp;
vector<priority_queue<int>> Q;

void dfs(int cur,int p){
	//cout<<cur<<endl;
	dp[cur] = 1;
	vector<int> t;
	rep(i,E[cur].size()){
		int to = E[cur][i];
		if(to==p)continue;
		dfs(to,cur);
		t.push_back(to);
		Q[cur].push(dp[to]);
	}
	if(t.size()==0)return;
	sort(t.begin(),t.end(),[&](int a,int b){
		return Q[a].size()<Q[b].size();
	});
	swap(Q[cur],Q[t.back()]);
	rep(i,E[cur].size()){
		int to = E[cur][i];
		if(to==p)continue;
		while(Q[to].size()!=0){
			Q[cur].push(Q[to].top());
			Q[to].pop();
		}
	}
	rep(i,2){
		if(Q[cur].size()==0)break;
		dp[cur] += Q[cur].top();
		Q[cur].pop();
	}
}
	

int main(){
	
	cin>>n;
	E.resize(n);
	rep(i,n-1){
		int u,v;
		cin>>u>>v;
		u--,v--;
		E[u].push_back(v);
		E[v].push_back(u);
	}
	
	dp.resize(n);
	Q.resize(n);
	
	dfs(0,-1);
	cout<<dp[0]<<endl;
	
    return 0;
}