#include <bits/stdc++.h>
using namespace std;
const int N = 200010, INF = 0x3f3f3f3f;
struct edge {
  int la, b;
} con[N << 1];
int tot, fir[N];
void add(int from, int to) {
  con[++tot] = (edge){fir[from], to};
  fir[from] = tot;
}
int n, mxdep[N][2], hson[N], ans;
void dfs(int pos, int fa) {
  mxdep[pos][0] = 0;
  mxdep[pos][1] = -INF;
  hson[pos] = 0;
  for (int i = fir[pos]; i; i = con[i].la) {
    if (con[i].b == fa) continue;
    dfs(con[i].b, pos);
    if (mxdep[con[i].b][0] > mxdep[hson[pos]][0] || (!hson[pos]))
      hson[pos] = con[i].b;
    if (mxdep[con[i].b][0] + 1 > mxdep[pos][0]) {
      mxdep[pos][1] = mxdep[pos][0];
      mxdep[pos][0] = mxdep[con[i].b][0] + 1;
    } else
      mxdep[pos][1] = max(mxdep[pos][1], mxdep[con[i].b][0] + 1);
  }
}
void fsd(int pos, int fa) {
  for (int i = fir[pos]; i; i = con[i].la) {
    if (con[i].b == fa) continue;
    int val = (con[i].b == hson[pos] ? mxdep[pos][1] : mxdep[pos][0]) + 1;
    if (val > mxdep[con[i].b][0]) {
      mxdep[con[i].b][1] = mxdep[con[i].b][0];
      mxdep[con[i].b][0] = val;
      hson[con[i].b] = pos;
    } else
      mxdep[con[i].b][1] = max(mxdep[con[i].b][1], val);
    fsd(con[i].b, pos);
  }
}
int main() {
  int x, y;
  scanf("%d", &n);
  for (int i = 1; i < n; ++i) {
    scanf("%d%d", &x, &y);
    add(x, y);
    add(y, x);
  }
  dfs(1, 0);
  fsd(1, 0);
  for (int i = 1; i <= n; ++i) {
    ans += mxdep[i][1] + 1;
    if (mxdep[i][0] > mxdep[i][1]) {
      int v = hson[i];
      if (i < v || mxdep[v][1] > mxdep[i][1]) ++ans;
    }
  }
  printf("%d\n", ans);
  return 0;
}
