#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxn = 200005;
vector<vector<int>>adj(mxn);
int n;

int ans = 0;
vector<int>lvl(mxn);
vector<int>dp(mxn);
map<int,int> dfs(int u, int p){
    lvl[u] = lvl[p]+1;
    map<int,int>hm;
    vector<int>nodes;
    for(int nxt: adj[u]){
        if(nxt==p)continue;
        nodes.push_back(nxt);
    }
    if(nodes.size() == 0){
        hm[lvl[u]] = 1;
        dp[u] = lvl[u];
        return hm;
    }
    if(nodes.size() == 1){
        hm = dfs(nodes[0],u);
        hm[lvl[u]] = 1;
        while(dp[nodes[0]] > lvl[u]+1){
            ans+=hm[dp[nodes[0]]];
            hm.erase(dp[nodes[0]]);
            dp[nodes[0]]--;
        }
        dp[u] = lvl[u]+1;
        return hm;
    }
    hm = dfs(nodes[0],u);
    map<int,int>hm2 = dfs(nodes[1],u);
    if(dp[nodes[0]] > dp[nodes[1]]){
        swap(nodes[0],nodes[1]);
    }
    if(hm.size() < hm2.size()){
        swap(hm,hm2);
    }
    for(auto [a,b] : hm2){
        hm[a]+=b;
    }
    while(dp[nodes[1]] > dp[nodes[0]]+1){
        ans+=hm[dp[nodes[1]]];
        hm.erase(dp[nodes[1]]);
        dp[nodes[1]]--;
    }
    dp[u] = dp[nodes[1]];
    return hm;
}
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i = 1; i<n; i++){
        int x,y;
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    dfs(1,0);
    cout << ans << '\n';
    return 0;
}