#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second

const int maxn = 1e5;

int n;
vector<int> g[maxn + 1];
int ans[maxn + 1];
int full[maxn + 1];
int par[maxn + 1];
int subtree_size[maxn + 1];

void dfs(int cur, int parent) {
    par[cur] = parent;
    for(int nei : g[cur]) {
        if(nei != parent) {
            dfs(nei, cur);
            subtree_size[cur] += subtree_size[nei];
            full[cur] += full[nei];
            ans[cur] += min(8 + ans[nei], 2 * subtree_size[nei] + full[nei]);
        }
    }
    subtree_size[cur]++;
    full[cur] += (subtree_size[cur] - 1) * 2;
}

void solve() {
    cin >> n;
    for(int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
    }
    dfs(1, 0);
    cout << ans[1] << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}