#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i ++)
#define per(i, r, l) for(int i = (r); i >= (l); i --)
#define trv(i, u, v) for(int i = head[u], v = e[i].to; i; v = e[i = e[i].nxt].to)
#define fi first
#define se second
#define all(s) s.begin(), s.end()
#define sz(s) (int)(s.size())
#define lb(s) ((s) & -(s))
#define pb push_back
using namespace std;

typedef long long ll;
typedef __int128 u64;
mt19937_64 hua(time(0));
template<typename T> inline bool chkmx(T &x, T y) {return x < y ? x = y, 1 : 0;}
template<typename T> inline bool chkmn(T &x, T y) {return y < x ? x = y, 1 : 0;}
template<int T> using A = array<int, T>;

inline int read() {
	int x = 0, f = 1; char c = getchar();
	for(; !isdigit(c); c = getchar()) if(c == '-')  f = 0;
	for(; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	return f ? x : -x;
}
const int maxn = 3e5;
const u64 mod[2] = {999999999999989, 999999999999883};
inline u64 add(u64 a, u64 b, u64 mod) {return (a += b) >= mod ? a - mod : a;}
inline u64 sub(u64 a, u64 b, u64 mod) {return (a -= b) < 0 ? a + mod : a;}
inline u64 mul(u64 a, u64 b, u64 mod) {return a * b % mod;}
struct mint {
	u64 x, y;
	mint(u64 _x = 0, u64 _y = 0) {x = _x, y = _y;}
	friend mint operator + (mint x, mint y) {
		return mint{add(x.x, y.x, mod[0]), add(x.y, y.y, mod[1])};
	}
	friend mint operator - (mint x, mint y) {
		return mint{sub(x.x, y.x, mod[0]), sub(x.y, y.y, mod[1])};
	}
	friend mint operator * (mint x, mint y) {
		return mint{mul(x.x, y.x, mod[0]), mul(x.y, y.y, mod[1])};
	}
	friend bool operator < (mint x, mint y) {
		return x.x == y.x ? x.x < y.x : x.y < y.y;
	}
	friend bool operator == (mint x, mint y) {
		return x.x == y.x && x.y == y.y;
	} 
	void debug() {
		cout << (ll) x << ' ' << (ll) y << '\n';
	}
}f[maxn + 5], g[maxn + 5], pw[maxn + 5], ipw[maxn + 5], pre[maxn + 5], suf[maxn + 5], spw[maxn + 5];
int prs[maxn + 5], sus[maxn + 5];
typedef pair<mint, pair<int, int>> pp;
const mint bs = {200131, 302139};
const mint ibs = {605888143266154, 498373265285125};
inline u64 fpw(u64 a, u64 b, u64 mod, u64 ans = 1) {
	for(; b; b >>= 1, a = mul(a, a, mod)) if(b & 1) ans = mul(ans, a, mod);
	return ans; 
}
int n;
vector<int> G[maxn + 5];
vector<mint> st;
int siz[maxn + 5];
void dfs1(int u, int par) {
	f[u] = {0, 0};
	vector<pp> s; 
	for(auto v : G[u]) if(v != par) {
		dfs1(v, u);
		s.pb({f[v], {siz[v], v}});
	}
	sort(all(s));
	siz[u] = 1;
	for(auto x : s) f[u] = f[u] + x.fi * pw[siz[u]], siz[u] += x.se.fi;
	f[u] = f[u] + spw[siz[u] - 1];
//	cout << u << ":\n"; f[u].debug();
}
void dfs2(int u, int par) {
//	cout << u << ":\n"; g[u].debug();
	vector<pp> s;
	s.pb({{0, 0}, {0, 0}});
	s.pb({g[u], {n - siz[u], u}});
	for(auto v : G[u]) if(v != par) {
		s.pb({f[v], {siz[v], v}});
	}
	sort(all(s));
	auto calc = [&] (int l, int r) {
		if(l > r) return mint{0, 0};
		return (pre[r] - pre[l - 1]) * ipw[prs[l - 1]];
	};
	prs[0] = 1, pre[0] = {0, 0};
	rep(i, 1, sz(s) - 1) {
		prs[i] = prs[i - 1] + s[i].se.fi;
		pre[i] = pre[i - 1] + s[i].fi * pw[prs[i - 1]];
	}
//	assert(prs[sz(s) - 1] == n);
	st.pb(pre[sz(s) - 1]);
	rep(i, 1, sz(s) - 1) {
		if(s[i].se.se == u) continue; 
		g[s[i].se.se] = (calc(1, i - 1) * bs + calc(i + 1, sz(s) - 1) * pw[prs[i - 1]]) + spw[n - siz[s[i].se.se] - 1];
	}
	for(auto v : G[u]) if(v != par) dfs2(v, u);
}
int main() {
//	freopen("in.txt", "r", stdin);
	pw[0] = ipw[0] = spw[0] = {1, 1};
	rep(i, 1, maxn) pw[i] = pw[i - 1] * bs, ipw[i] = ipw[i - 1] * ibs, spw[i] = spw[i - 1] + pw[i];
	n = read();
	rep(i, 2, n) {
		int u = read(), v = read();
		G[u].pb(v), G[v].pb(u);
	}
	dfs1(1, 1);
//	rep(i, 1, n) {
//		dfs1(i, i);
//		st.pb(f[i]);
//	}
		
//	return 0;
	dfs2(1, 1);
	sort(all(st)), st.erase(unique(all(st)), st.end());
	cout << sz(st) << '\n';
	return 0;
}