/*****************
*   I<3   C++   *
*  IWANT ANYAC  *
* ILOVEPROGRAM! *
*IT'SINTERESTING*
* ILOVEPROGRAM! *
*  INCONTESTS   *
*   GETSCORE    *
*    ACCODE     *
*     LETS      *
*      GO       *
*Written by:    *
*    charlieyan *
*****************/
#include <assert.h>
#include <ctype.h>
#include <errno.h>
#include <float.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <locale>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <wchar.h>
#include <wctype.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <complex.h>
#include <fenv.h>
#include <inttypes.h>
#include <stdbool.h>
#include <stdint.h>
#include <numeric>
#include <list>
#define LL long long
#define pb push_back
#define pob pop_back
#define mp make_pair
#define FILL(a,v) memset((void*)a,v,sizeof(a))
#define FILL0(a) FILL(a,0)
#define FILL1(a) FILL(a,-1)
#define FILLBIG(a) FILL(a,0x7f)
#define ALL(a) (a).begin(),(a).end()
#define Inf ((int)0x7f7f7f7f)
#define INF ((long long)0x7f7f7f7f7f7f7f7f)
#define Mod 1000000007
#define foreach(it,x) for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define FOR(i,x) for(int i=0;i<x;i++)
#define RFOR(i,x) for(int i=x-1;i>=0;i--)
#define FFOR(i,a,b) for(int i=a;i<b;i++)
#define FRFOR(i,a,b) for(int i=a-1;i>=b;i--)
#define SZ(a) ((int)(a).size())
#define FI first
#define SE second
#define OVER(a) return puts(a),0
#define fastio ios::sync_with_stdio(0)
#define filei(f) freopen(f,"r",stdin)
#define fileo(f) freopen(f,"w",stdout)
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define MASK(a) (1<<(a))
#define MASKX(x,a) ((x)<<(a))
#define BIT(a,b) ((a>>b)&1)
#define cddx(a) priority_queue<a >
#define cxdd(a) priority_queue<a,vector<a >,greater<a > >
#define deval(a) {cerr<<#a<<" = "<<a<<endl;}
#define dearr(be,en) {cerr<<#be;cerr<<" = {";for(auto i=be;i!=en;i++)cerr<<' '<<*i;cerr<<" }\n";}
#define reg register
#define prtime eprintf("\n\nTime used: %dms\n",clock());
#define PI 3.1415926535897932384626
#define expause return getchar(),getchar(),0;
using namespace std;
typedef pair<int, int> pii;
typedef unsigned long long UINT;
typedef unsigned int uint;
typedef long long INT;
typedef long double ldouble;
typedef pair<INT, INT> PII;
typedef stringstream sst;
typedef istringstream iss;
typedef vector<int> vint;
typedef vector<INT> VINT;
typedef vector<pii> vpii;
typedef vector<PII> VPII;
typedef priority_queue<int> pqi;
typedef priority_queue<INT> PQI;
typedef priority_queue<pii> pqp;
typedef priority_queue<PII> PQP;
typedef priority_queue<int, vint, greater<int> > xqi;
typedef priority_queue<INT, VINT, greater<INT> > XQI;
typedef priority_queue<pii, vpii, greater<pii> > xqp;
typedef priority_queue<PII, VPII, greater<PII> > XQP;
const int Maxn = 100007;
//Orz Shurong Wang he is a DALAO.
//Orz The_27 he is a SHENBEN.
//Orz Chinauser he is a JULAO
//Don't Orz me. I am a JURUO.

int n;
int deg[Maxn];
vector<int> nei[Maxn];

int main()
{
	scanf("%d", &n);
	for (int i = 0; i < n - 1; i++)
	{
		int a, b;
		scanf("%d%d", &a, &b);
		nei[a].pb(b);
		nei[b].pb(a);
		deg[a]++; deg[b]++;
	}
	int mx = 0;
	for (int i = 0; i < n; i++)mx = max(mx, deg[i]);
	if (mx <= 2)
	{
		puts("1");
		return 0;
	}
	queue<int> q;
	for (int i = 0; i < n; i++)
	{
		if (deg[i] == 1)
			q.push(i);
	}
	while (!q.empty())
	{
		int qq = q.front(); q.pop();
		int to = 0;
		for (int i = 0; i < SZ(nei[qq]); i++)
		{
			to = nei[qq][i];
			if (deg[to] != 1)break;
		}
		if (deg[to] == 2)
		{
			deg[to] = 1;
			q.push(to);
		}
	}
	int res = 0;
	for (int i = 0; i < n; i++)
	{
		if (deg[i] == 1)continue;
		int nm = 0;
		for (int j = 0; j < SZ(nei[i]); j++)
		{
			int to = nei[i][j];
			if (deg[to] == 1)nm++;
		}
		res += max(0, nm - 1);
	}
	printf("%d\n", res);
	return 0;
}

Measured memory_bytes: 7040