#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 2e5+5;
const int DEG = 20;
typedef long long ll;struct Edge{int to, next;
}edge[maxn*2];
int tot, head[maxn];void init() {tot = 0;memset(head, -1, sizeof head);
}void addedge(int u, int v) {edge[tot].to = v;edge[tot].next = head[u];head[u] = tot++;
}int fa[maxn][20];
int dep[maxn];void BFS(int root) {queue<int> que;dep[root] = 0;fa[root][0] = root;que.push(root);while(!que.empty()) {int tmp = que.front();que.pop();for(int i = 1; i < DEG; i++)fa[tmp][i] = fa[fa[tmp][i-1]][i-1];for(int i = head[tmp]; i !=  -1; i = edge[i].next) {int v = edge[i].to;if(v==fa[tmp][0]) continue;dep[v] = dep[tmp] + 1;fa[v][0] = tmp;que.push(v);}}
}int LCA(int u, int v) {if(dep[u] > dep[v]) swap(u, v);int hu = dep[u], hv = dep[v];int tu = u, tv = v;for(int det = hv-hu, i = 0; det; det >>= 1, i++) {if(det & 1) {tv = fa[tv][i];}}if(tu == tv) {return tu;}for(int i = DEG-1; i >= 0; i--) {if(fa[tu][i] == fa[tv][i]) {continue;}tu = fa[tu][i];tv = fa[tv][i];}return fa[tu][0];
}bool flag[maxn];int main() {int n;int u, v;int root;scanf("%d", &n);init();memset(flag, 0, sizeof flag);for(int i = 0; i < n-1; i++) {scanf("%d%d", &u, &v);addedge(u, v);addedge(v, u);flag[v] = true;}for(int i = 1; i <= n; i++) {if(!flag[i]) {root = i;break;}}BFS(root);ll sum = 0;int lca;for(int i = 1; i <= n; i++) {for(int j = 2; i*j <= n; j++) {lca = LCA(i, i*j);sum += dep[i] + dep[i*j] - dep[lca]*2 + 1;}}printf("%lld\n", sum);return 0;
}