#include <iostream> #include <cstdio> #include <cstring> #include <vector> #include <deque> #include <queue> #include <array> #include <set> #include <map> #include <cmath> #include <algorithm> #include <numeric> #include <cassert> #include <utility> #include <functional> using namespace std; using lli = long long int; template<class T, class U> void init_n(vector<T>& v, size_t n, U x) { v = vector<T>(n, x); } template<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); } template<class T> void read_n(vector<T>& v, size_t n, size_t o = 0) { v = vector<T>(n+o); for (lli i=o; i<n+o; ++i) cin >> v[i]; } template<class T> void read_n(T a[], size_t n, size_t o = 0) { for (lli i=o; i<n+o; ++i) cin >> a[i]; } template<class T> T gabs(const T& x) { return max(x, -x); } #define abs gabs lli n, c[100001]; int main() { cin >> n; lli ans = 0; for (lli i=0; i<n-1; ++i) { lli a, b; cin >> a >> b; c[a]++; c[b]++; } for (lli i=0; i<=n; ++i) { ans += max(0ll, c[i]-2); } cout << ans << '\n'; return 0; }