#include using namespace std; #define SZ(x) (int) (x).size() #define REP(i, n) for(int i = 0; i < (n); i++) #define FOR(i, a, b) for(auto i = (a); i < (b); i++) #define For(i, a, b, c) \ for(auto i = (a); i != (b); i += (c)) #define REPR(i, n) for(auto i = (n) -1; i >= 0; i--) #define ALL(s) (s).begin(), (s).end() #define so(V) sort(ALL(V)) #define rev(V) reverse(ALL(V)) #define uni(v) v.erase(unique(ALL(v)), (v).end()) #define eb emplace_back typedef unsigned long long ull; typedef long long ll; typedef vector vi; typedef vector vll; typedef vector vb; typedef vector vvi; typedef vector vvll; typedef pair PI; typedef pair PL; const double EPS = 1e-6; const int MOD = 1e9 + 7; const int INF = (1 << 30); const ll LINF = 1e18; const double math_PI = acos(-1); template vector make_v(size_t a) { return vector(a); } template auto make_v(size_t a, Ts... ts) { return vector(ts...))>( a, make_v(ts...)); } template typename enable_if::value == 0>::type fill_v( T& t, const V& v) { t = v; } template typename enable_if::value != 0>::type fill_v( T& t, const V& v) { for(auto& e: t) fill_v(e, v); } template bool chmax(T& a, const T& b) { if(a < b) { a = b; return true; } return false; } template bool chmin(T& a, const T& b) { if(a > b) { a = b; return true; } return false; } template istream& operator>>(istream& is, pair& p) { cin >> p.first >> p.second; return is; } template istream& operator>>(istream& is, vector& vec) { for(T& x: vec) is >> x; return is; } template string join(vector& vec, string splitter) { stringstream ss; REP(i, SZ(vec)) { if(i != 0) ss << splitter; ss << vec[i]; } return ss.str(); } template ostream& operator<<(ostream& os, vector& vec) { os << join(vec, " "); return os; } template struct Edge { public: int from, to; T cost; Edge() { } Edge(int _from, int _to, T _cost) { from = _from; to = _to; cost = _cost; } }; template using Edges = vector>; template using Graph = vector>; vll dijkstra(int s, const Graph& G) { using P = pair; priority_queue, greater<>> que; vll D(SZ(G), LINF); D[s] = 0; que.push(P(0, s)); while(!que.empty()) { P p = que.top(); que.pop(); int v = p.second; if(D[v] < p.first) continue; for(Edge e: G[v]) { if(D[e.to] > D[v] + e.cost) { D[e.to] = D[v] + e.cost; que.push(P(D[e.to], e.to)); } } } return D; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int N; cin >> N; if(N == 1) { cout << 1 << endl; return 0; } Graph<> G(N); REP(i, N - 1) { int u, v; cin >> u >> v; u--; v--; G[u].eb(u, v, 1); G[v].eb(v, u, 1); } auto d = dijkstra(0, G); int odd = 0; REP(i, N) { if(d[i] % 2 == 1) { odd++; } } int even = N - odd; cout << min(even, odd) << endl; return 0; }