#include <atcoder/segtree>
using namespace atcoder;

#include <iostream>
#include <vector>
#include <utility>
#include <deque>
using namespace std;

pair<int,int> op(pair<int,int> a,pair<int,int> b){
  return a>b?a:b;
}

pair<int,int> e(){
  return make_pair(-1,-1);
}
int main(){
  int N;
  cin>>N;
  vector<vector<int>> Graph(N);
  for(int i=0;i<N-1;i++){
    int x,y;
    cin>>x>>y;
    Graph[x-1].push_back(y-1);
    Graph[y-1].push_back(x-1);
  }
  segtree<pair<int,int>,op,e> seg(N);
  deque<int> que;
  que.push_back(N);
  que.push_back(0);
  vector<bool> checked(N,false);
  vector<int> pre(N);
  vector<int> cnt(N,1);
  int searched=0;
  while(!que.empty()){
    int q=que.back();que.pop_back();
    if(q<N){
      pre[q]=searched;
      checked[q]=true;
      for(int to:Graph[q]){
        if(!checked[to]){
          que.push_back(to+N);
          que.push_back(to);
        }
      }
    }else{
      for(int j=0;j<2;j++){
        pair<int,int> tmp=seg.prod(pre[q-N],searched);
        if(tmp.first==-1){
          break;
        }
        cnt[q-N]+=tmp.first;
        seg.set(tmp.second,e());
      }
      seg.set(searched,make_pair(cnt[q-N],searched));
      searched++;
    }
  }
  cout<<cnt[0]<<endl;
  return 0;
}