#include <algorithm> #include <cassert> #include <cmath> #include <cstdio> #include <cstring> #include <iomanip> #include <iostream> #include <map> #include <memory> #include <numeric> #include <queue> #include <set> #include <stack> #include <string> #include <vector> #define rep(i, a, b) for (int i = (a); i < (b); ++i) #define MOD 1000000007 #define int long long using ll = long long; using namespace std; const int INF = 1LL << 50; using P = pair<int, int>; struct Setup { Setup() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); } } SETUP; template <class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } else { return false; } } template <class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } else { return false; } } signed main() { int n; cin >> n; vector<vector<int>> graph(n); rep(i, 0, n - 1) { int from, to; cin >> from >> to; from--, to--; graph[from].push_back(to); graph[to].push_back(from); } int leaf = 0; rep(i, 0, n) { if (graph[i].size() == 1) leaf++; } cout << leaf - 2 << endl; }