import os,sys,random,threading
#sys.exit() 退出程序
#sys.setrecursionlimit(10**6) #调整栈空间
from random import randint,choice,shuffle
#randint(a,b)从[a,b]范围随机选择一个数
#choice(seq)seq可以是一个列表,元组或字符串,从seq中随机选取一个元素
#shuffle(x)将一个可变的序列x中的元素打乱
from copy import deepcopy
from io import BytesIO,IOBase
from types import GeneratorType
from functools import lru_cache,reduce
#reduce(op,迭代对象)
from bisect import bisect_left,bisect_right
#bisect_left(x) 大于等于x的第一个下标
#bisect_right(x) 大于x的第一个下标
from collections import Counter,defaultdict,deque
from itertools import accumulate,combinations,permutations
#accumulate(a)用a序列生成一个累积迭代器，一般list化前面放个[0]做前缀和用
#combinations(a,k)a序列选k个 组合迭代器
#permutations(a,k)a序列选k个 排列迭代器
from heapq import  heapify,heappop,heappush
#heapify将列表转为堆
from typing import Generic,Iterable,Iterator,TypeVar,Union,List
from string import ascii_lowercase,ascii_uppercase,digits
#小写字母，大写字母，十进制数字
from math import ceil,floor,sqrt,pi,factorial,gcd,log,log10,log2,inf
#ceil向上取整，floor向下取整 ，sqrt开方 ，factorial阶乘
from decimal import Decimal,getcontext
#Decimal(s) 实例化Decimal对象,一般使用字符串
#getcontext().prec=100 修改精度
from sys import stdin, stdout, setrecursionlimit
input = lambda: sys.stdin.readline().rstrip("\r\n")
MI = lambda :map(int,input().split())
li = lambda :list(MI())
ii = lambda :int(input())
mod = int(1e9 + 7) #998244353
inf = 1<<60
py = lambda :print("YES")
pn = lambda :print("NO")
DIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)]  # 右下左上
DIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)]  # →↘↓↙←↖↑↗


def bootstrap(f, stack=[]):   #yield
    def wrappedfunc(*args, **kwargs):
        if stack:
            return f(*args, **kwargs)
        else:
            to = f(*args, **kwargs)
            while True:
                if type(to) is GeneratorType:
                    stack.append(to)
                    to = next(to)
                else:
                    stack.pop()
                    if not stack:
                        break
                    to = stack[-1].send(to)
            return to
    return wrappedfunc



n=ii()

g=[[] for _ in range(n+1)]

for _ in range(n-1):
    u,v=li()
    g[u]+=[v]
    g[v]+=[u]


h=[0]*(n+1) #i子树中，i所在最长链
d=[0]*(n+1) #i子树直径


@bootstrap
def dfs(u,fa):
    pre=-1
    for v in g[u]:
        if v==fa:
            continue
        yield dfs(v,u)
        d[u]=max(d[u],d[v],pre+h[v]+2)
        pre=max(pre,h[v])
        h[u]=max(h[u],h[v]+1)
    yield None

dfs(1,-1)


#print(d)

global res
res=inf


@bootstrap
def dfs2(u,fa):
    global res
    f1=f2=f3=-1
    d1=d2=0
    for v in g[u]:
        if h[v]>f1:
            f1,f2,f3=h[v],f1,f2
        elif h[v]>f2:
            f2,f3=h[v],f2
        elif h[v]>f3:
            f3=h[v]
        if d[v]>d1:
            d1,d2=d[v],d1
        elif d[v]>d2:
            d2=d[v]
    
    for v in g[u]:
        if v==fa:
            continue
        
        if d1==d[v]:
            nd1=d2
        else:
            nd1=d1
        if f1==h[v]:
            nd1=max(nd1,f2+f3+2)
        elif f2==h[v]:
            nd1=max(nd1,f1+f3+2)
        else:
            nd1=max(nd1,f1+f2+2)
        nd2=d[v]
        
        newd=max((nd1+1)//2+(nd2+1)//2+1,nd1,nd2)
        #print(u,v,nd1,nd2,newd)
        res=min(res,newd)
        d[u]=nd1
        if f1==h[v]:
            h[u]=f2+1
        else:
            h[u]=f1+1
        yield dfs2(v,u)

    yield None

dfs2(1,-1)

print(res)