#include <bits/stdc++.h>
using namespace std;
vector<int> g[300005];
int dp[300005][25];
int D[300005];
int n;
void dfs1(int u, int p) {
  D[u] = 1;
  for (int i = 0; i < (int)(g[u]).size(); i++) {
    int v = g[u][i];
    if (v != p) {
      dfs1(v, u);
      D[u] = max(D[u], D[v] + 1);
    }
  }
  for (int d = 2; d < 20; d++) {
    vector<int> sum;
    for (int i = 0; i < (int)(g[u]).size(); i++) {
      int v = g[u][i];
      if (v != p) sum.emplace_back(dp[v][d - 1]);
    }
    sort((sum).begin(), (sum).end());
    reverse((sum).begin(), (sum).end());
    int mn = 1e9;
    for (int i = 0; i < (int)(sum).size(); i++) {
      mn = min(mn, sum[i]);
      dp[u][d] = max(dp[u][d], min(i + 1, mn));
    }
  }
  dp[u][1] = n;
}
void dfs2(int u, int p) {
  for (int i = 0; i < (int)(g[u]).size(); i++) {
    int v = g[u][i];
    if (v != p) {
      dfs2(v, u);
      for (int d = 1; d < 20; d++) {
        dp[u][d] = max(dp[u][d], dp[v][d]);
      }
    }
  }
  for (int d = 18; d >= 1; d--) dp[u][d] = max(dp[u][d], dp[u][d + 1]);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n - 1; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    g[a].emplace_back(b);
    g[b].emplace_back(a);
  }
  dfs1(1, 0);
  dfs2(1, 0);
  long long ans = 0;
  for (int u = 1; u <= n; u++) {
    if (D[u] > 19) {
      ans += D[u];
    }
    for (int d = 19; d >= 1; d--) {
      int diff = dp[u][d] - dp[u][d + 1];
      if (D[u] > 19 && d == 19) diff--;
      ans += diff * 1ll * d;
    }
  }
  printf("%lld\n", ans);
}
