def f(n,u)
	res=[0]
	$gs[n].each{|u2|
		next if u==u2
		res<<f(u2,n)
	}
	if n==1 then
		res2=res.sort.reverse[0,2]
		ans=1
		case res2.size
		when 1
			ans=res2[0]
		else
			ans=res2.sum
		end
		return ans
	else
		
		return res.max+1
	end
end
n=gets.to_i
$gs=[]
(n+1).times{
	$gs<<[]
}

(n-1).times{|i|
	a,b=gets.split(" ").map{|e| e.to_i}
	$gs[a]<<b
	$gs[b]<<a
}
puts n-1-f(1,-1)