AT_agc009_d Uninity

#include<bits/stdc++.h>
#define mod 1000000007
#define w 200010
#define inf 1e9
using namespace std;
int read(){
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+c-'0';c=getchar();}
	return x*f;
}int n,m,ans,lab[w],s[w],beg[w],nex[w],to[w],e;
void add(int x,int y){nex[++e]=beg[x],beg[x]=e,to[e]=y,nex[++e]=beg[y],beg[y]=e,to[e]=x;}
void dfs(int x,int fa){
	int tt=0;
	for(int i=beg[x];i;i=nex[i]){
		int t=to[i];
		if(t==fa)continue;
		dfs(t,x),tt|=s[x]&s[t],s[x]|=s[t];
	}int k=tt?32-__builtin_clz(unsigned(tt)):0;
	lab[x]=__builtin_ctz(unsigned((s[x]|((1<<k)-1))+1));
	s[x]=(s[x]>>lab[x]|1)<<lab[x];
}int main(){
	n=read();
	for(int i=1,x,y;i<n;i++)x=read(),y=read(),add(x,y);
	dfs(1,0);
	for(int i=1;i<=n;i++)ans=max(ans,lab[i]);
	cout<<ans;
}