#include <bits/stdc++.h>
#define fi first
#define se second
#define forn(i,a,n) for(int i=a; i< (int)n; ++i)
#define pb push_back
#define el '\n'
#define d(x) cerr<< #x<< " " << x<<el
#define sz(v) ((int)v.size())
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
using namespace std;

typedef long long ll;
typedef double ld;
typedef pair<int,int> ii;
typedef pair<char,int> pci;
typedef tuple<int, int, int> tiii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  cout << setprecision(20)<< fixed;

  int n; cin>>n;
  set<int> g[n];
  vi deg(n);
  vector<bool> seen(n);
  forn(i,0,n - 1){
    int u,v; cin>>u>>v; 
    --u; --v;
    g[u].insert(v);
    g[v].insert(u);
    deg[u]++;
    deg[v]++;
  }
  int start = 0;
  forn(i,0,n)if(deg[i] > 1){start = i; break;}
  queue<int> q;
  q.push(start);
  seen[start] = true;
  ll ans = 0;
  while(sz(q)){
    int u = q.front(); q.pop();
    int leafs = 0;
    for(int v : g[u]){
      if(!seen[v]){
        seen[v] = true;
        if(deg[v] > 1){
          q.push(v);
        }else leafs++;
      }
    }
    if(leafs > 0){
      ans += 2ll * (leafs - 1) + 1ll;
    }else ans += 2;
  }
  cout << ans <<el;
}