#include using i32 = std::int32_t; using u32 = std::uint32_t; using i64 = std::int64_t; using u64 = std::uint64_t; using i128 = __int128_t; using u128 = __uint128_t; using isize = std::ptrdiff_t; using usize = std::size_t; class rep { struct Iter { usize itr; constexpr Iter(const usize pos) noexcept : itr(pos) {} constexpr void operator++() noexcept { ++itr; } constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; } constexpr usize operator*() const noexcept { return itr; } }; const Iter first, last; public: explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {} constexpr Iter begin() const noexcept { return first; } constexpr Iter end() const noexcept { return last; } }; template struct RecursiveLambda : private F { explicit constexpr RecursiveLambda(F&& f) : F(std::forward(f)) {} template constexpr decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, std::forward(args)...); } }; template constexpr decltype(auto) rec_lambda(F&& f) { using G = std::decay_t; return RecursiveLambda(std::forward(f)); } template using Vec = std::vector; void main_() { usize N; std::cin >> N; Vec> graph(N); for (const auto i : rep(1, N)) { usize a, b; std::cin >> a >> b; a -= 1; b -= 1; graph[a].push_back(b); graph[b].push_back(a); } std::array cnt{}; rec_lambda([&](auto&& dfs, const usize u, const usize p, const usize k) -> void { cnt[k] += 1; for (const auto v : graph[u]) { if (v != p) { dfs(v, u, k ^ 1); } } })(0, 0, 0); std::cout << std::min(cnt[0], cnt[1]) << '\n'; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); main_(); return 0; }