Problem: Momiji has got a rooted tree, consisting of n nodes. The tree nodes are numbered by integers from 1 to n. The root has number 1. Momiji decided to play a game on this tree.

The game consists of several steps. On each step, Momiji chooses one of the remaining tree nodes (let's denote it by v) and removes all the subtree nodes with the root in node v from the tree. Node v gets deleted as well. The game finishes when the tree has no nodes left. In other words, the game finishes after the step that chooses the node number 1.

Each time Momiji chooses a new node uniformly among all the remaining nodes. Your task is to find the expectation of the number of steps in the described game.

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of nodes in the tree. The next n - 1 lines contain the tree edges. The i-th line contains integers ai, bi (1 ≤ ai, bi ≤ n; ai ≠ bi) — the numbers of the nodes that are connected by the i-th edge.

It is guaranteed that the given graph is a tree.

Output

Print a single real number — the expectation of the number of steps in the described game.

The answer will be considered correct if the absolute or relative error doesn't exceed 10 - 6.

Examples

Input

2
1 2


Output

1.50000000000000000000


Input

3
1 2
1 3


Output

2.00000000000000000000

Note

In the first sample, there are two cases. One is directly remove the root and another is remove the root after one step. Thus the expected steps are: 

1 × (1 / 2) + 2 × (1 / 2) = 1.5

In the second sample, things get more complex. There are two cases that reduce to the first sample, and one case cleaned at once. Thus the expected steps are: 

1 × (1 / 3) + (1 + 1.5) × (2 / 3) = (1 / 3) + (5 / 3) = 2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const long long inf = 0x3f3f3f3f;
int Head[maxn], edgesNum = 0, n, u, v;
struct NODE {
  int id, step;
};
struct EDGE {
  int to, next;
} edges[maxn << 1];
void addEdge(int u, int v) {
  edges[edgesNum].to = v;
  edges[edgesNum].next = Head[u];
  Head[u] = edgesNum++;
}
double ans = 0.0;
void BFS(int s) {
  ans = 0.0;
  bool vis[maxn];
  memset(vis, false, sizeof(vis));
  vis[s] = true;
  NODE t;
  t.id = s;
  t.step = 1;
  queue<NODE> q;
  q.push(t);
  while (!q.empty()) {
    t = q.front();
    int u = t.id;
    q.pop();
    ans += 1.0 / t.step;
    for (int e = Head[u]; ~e; e = edges[e].next) {
      int v = edges[e].to;
      if (!vis[v]) {
        NODE tt;
        tt.id = v;
        tt.step = t.step + 1;
        q.push(tt);
        vis[v] = true;
      }
    }
  }
  printf("%.20lf\n", ans);
}
int main() {
  while (~scanf("%d", &n)) {
    memset(Head, -1, sizeof(Head));
    for (int i = 1; i <= n - 1; i++) {
      scanf("%d%d", &u, &v);
      addEdge(u, v);
      addEdge(v, u);
    }
    BFS(1);
  }
  return 0;
}