Problem: In computer science, there is a method called "Divide And Conquer By Node" to solve some hard problems about paths on a tree. Let's desribe how this method works by function:

solve(t) (t is a tree): 

  1. Chose a node x (it's common to chose weight-center) in tree t. Let's call this step "Line A". 
  2. Deal with all paths that pass x. 
  3. Then delete x from tree t. 
  4. After that t becomes some subtrees. 
  5. Apply solve on each subtree. 



This ends when t has only one node because after deleting it, there's nothing. 

Now, WJMZBMR has mistakenly believed that it's ok to chose any node in "Line A". So he'll chose a node at random. To make the situation worse, he thinks a "tree" should have the same number of edges and nodes! So this procedure becomes like that.

Let's define the variable totalCost. Initially the value of totalCost equal to 0. So, solve(t) (now t is a graph): 

  1. totalCost = totalCost + (size of t). The operation "=" means assignment. (Size of t) means the number of nodes in t. 
  2. Choose a node x in graph t at random (uniformly among all nodes of t). 
  3. Then delete x from graph t. 
  4. After that t becomes some connected components. 
  5. Apply solve on each component. 



He'll apply solve on a connected graph with n nodes and n edges. He thinks it will work quickly, but it's very slow. So he wants to know the expectation of totalCost of this procedure. Can you help him?

Input

The first line contains an integer n (3 ≤ n ≤ 3000) — the number of nodes and edges in the graph. Each of the next n lines contains two space-separated integers ai, bi (0 ≤ ai, bi ≤ n - 1) indicating an edge between nodes ai and bi.

Consider that the graph nodes are numbered from 0 to (n - 1). It's guaranteed that there are no self-loops, no multiple edges in that graph. It's guaranteed that the graph is connected.

Output

Print a single real number — the expectation of totalCost. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.

Examples

Input

5
3 4
2 3
2 4
0 4
1 2


Output

13.166666666666666


Input

3
0 1
1 2
0 2


Output

6.000000000000000


Input

5
0 1
1 2
2 0
3 0
4 1


Output

13.166666666666666

Note

Consider the second example. No matter what we choose first, the totalCost will always be 3 + 2 + 1 = 6.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3005;
inline void read(int &x) {
  x = 0;
  int f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  x *= f;
}
inline void judge() {
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
}
int head[maxn], ne[maxn << 1], t[maxn << 1], S[maxn], top, cycle, num, n,
    belong[maxn], dis[maxn];
bool ins[maxn], ok, oncy[maxn];
double ans = 0;
inline void addedge(int x, int y) {
  ne[++num] = head[x];
  head[x] = num;
  t[num] = y;
}
inline void findcycle(int u, int fa) {
  S[++top] = u;
  ins[u] = 1;
  for (int i = head[u]; i != -1; i = ne[i])
    if (t[i] != fa) {
      if (ok) return;
      if (ins[t[i]]) {
        while (S[top] != t[i]) oncy[S[top--]] = 1, cycle++;
        cycle++;
        oncy[t[i]] = 1;
        ok = 1;
        return;
      }
      findcycle(t[i], u);
    }
  top--;
}
inline void dfs_find(int u, int fa, int rt, int d) {
  belong[u] = rt;
  dis[u] = d;
  for (int i = head[u]; i != -1; i = ne[i])
    if (t[i] != fa && !oncy[t[i]]) dfs_find(t[i], u, rt, d + 1);
}
int p, first;
inline void dfs_ans(int u, int fa, int d) {
  if (u == belong[p]) {
    if (first) return;
    first += 1;
  }
  ans += 1.0 / (d + 1);
  for (int i = head[u]; i != -1; i = ne[i])
    if (t[i] != fa) {
      dfs_ans(t[i], u, d + 1);
    }
}
int main() {
  read(n);
  for (int i = (1); i <= (n); i++) head[i] = -1;
  for (int i = (1); i <= (n); i++) {
    int a, b;
    read(a);
    read(b);
    a++;
    b++;
    addedge(a, b);
    addedge(b, a);
  }
  findcycle(1, -1);
  for (int i = (1); i <= (n); i++)
    if (oncy[i]) dfs_find(i, -1, i, 0);
  for (int i = (1); i <= (n); i++) p = i, first = 0, dfs_ans(i, -1, 0);
  for (int i = (1); i <= (n); i++)
    for (int j = (1); j <= (n); j++)
      if (belong[i] != belong[j]) ans -= 1.0 / (dis[i] + dis[j] + cycle);
  printf("%.23lf\n", ans);
  return 0;
}