#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fi first
#define in inline
#define se second
#define mp make_pair
#define pb push_back
const int N = 1e5+10;

ll read(){
	ll x = 0,f = 1;char c = getchar();
	for(;c < '0' || c > '9';c = getchar())if(c == '-')f = -1;
	for(;c >= '0' && c <= '9';c = getchar())x = (x<<1) + (x<<3) + c-'0';
	return x * f;
}


int n;
vector<int>e[N];


int f[N],g[N],ans;
void dfs(int x,int fa){
	for(int y : e[x]){
		if(y == fa)continue;
		dfs(y,x);
		f[x] = max(f[x],f[y] + (int)e[x].size() - 2);
	}
	f[x] = max(f[x],(int)e[x].size() - 1);
	ans = max(ans,f[x] + 1);
}
void dfs2(int x,int fa){
	for(int y : e[x]){
		if(y == fa)continue;
		dfs2(y,x);
		ans = max(ans,g[x] + f[y] + (int)e[x].size() - 2);
		g[x] = max(g[x],f[y]);
	}
}


int main(){
	freopen("drill.in","r",stdin);
	freopen("drill.out","w",stdout);
	n = read();
	for(int i = 1;i < n;i++){
		int x = read(),y = read();
		e[x].pb(y),e[y].pb(x);
	}
	dfs(1,0);
//	for(int i = 1;i <= n;i++)printf("%d ",f[i]);
//	printf("\n");
//	printf("%d\n",ans);
	dfs2(1,0);
	printf("%d\n",ans);

	return 0;

}