#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 210000;

vector<int> g[maxn];
int lca[20][maxn];
bool vis[maxn];
int dep[maxn];

void dfs(int u){
    vis[u] = true;
    for (auto v : g[u]) {
        if (!vis[v]) {
            lca[0][v] = u;
            dep[v] = dep[u] + 1;
            for (int i = 0; lca[i][v]; i++) {
                lca[i+1][v] = lca[i][lca[i][v]];
            }
            dfs(v);
        }
    }
}

int getLCA(int x, int y){ 
    if (dep[x] < dep[y]) swap(x,y);
    int delta = (dep[x] - dep[y]);
    for (int i = 17; i >= 0; i--) {
        if (delta & (1 << i)) {
            x = lca[i][x];
        }
    }
    if (x == y) {
        return x;
    }
    for (int i = 17; i >= 0; i--) {
        if (lca[i][x] != lca[i][y]) {
            x = lca[i][x];
            y = lca[i][y];
        }
    }
    return lca[0][x];
}

int main() {
    int n;
    cin >> n;
    for (int i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    dfs(1);
    ll tot = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 2*i; j <= n; j += i) {
            tot += dep[i] + dep[j] - 2*dep[getLCA(i,j)] + 1;
        }
    }
    cout << tot << endl;
}