#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<unordered_map>
#include<queue>
#include<iomanip>
#include<math.h>
#include<bitset>
#include<cassert>
#include<random>
#include<time.h>
#include<functional>
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
#define MOD 1000000007LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i,n,m) for(ll i=n;i<(ll)m;i++)
#define REP(i,n) FOR(i,0,n)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cout<<" ";else cout<<endl;}
#define ALL(v) v.begin(),v.end()
#define UNIQUE(v)  sort(ALL(v));v.erase(unique(ALL(v)),v.end());
#define pb push_back

/* --------------------------------------- */

ll n;
vector<vector<ll>> g;
vector<ll> cnt;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cin >> n;
	g.resize(n);
	cnt.resize(n, 0);
	REP(i, n - 1) {
		ll u, v;
		cin >> u >> v;
		u--; v--;
		g[u].pb(v); cnt[u]++;
		g[v].pb(u); cnt[v]++;
	}
	priority_queue<P> q;
	vector<bool> used(n, false);
	ll ans = 1;
	REP(i,n) q.push(P(cnt[i],i));
	while(!q.empty()) {
		ll cost = q.top().first;
		ll p = q.top().second;
		q.pop();
		if(cnt[p] != cost) continue;
		if(cost == 0) break;
		used[p] = true;
		ans += cost - 1;
		REP(i,g[p].size()) {
			if(used[g[p][i]]) continue;
			cnt[g[p][i]]--;
			q.push(P(cnt[g[p][i]], g[p][i]));
		}
	}
	cout << ans << endl;
 	return 0;
}

/* --------------------------------------- */