Problem: Limak is a little grizzly bear. He will once attack Deerland but now he can only destroy trees in role-playing games. Limak starts with a tree with one vertex. The only vertex has index 1 and is a root of the tree.

Sometimes, a game chooses a subtree and allows Limak to attack it. When a subtree is attacked then each of its edges is destroyed with probability <image>, independently of other edges. Then, Limak gets the penalty — an integer equal to the height of the subtree after the attack. The height is defined as the maximum number of edges on the path between the root of the subtree and any vertex in the subtree.

You must handle queries of two types.

  * 1 v denotes a query of the first type. A new vertex appears and its parent is v. A new vertex has the next available index (so, new vertices will be numbered 2, 3, ...). 
  * 2 v denotes a query of the second type. For a moment let's assume that the game allows Limak to attack a subtree rooted in v. Then, what would be the expected value of the penalty Limak gets after the attack? 



In a query of the second type, Limak doesn't actually attack the subtree and thus the query doesn't affect next queries.

Input

The first line of the input contains one integer q (1 ≤ q ≤ 500 000) — the number of queries.

Then, q lines follow. The i-th of them contains two integers typei and vi (1 ≤ typei ≤ 2). If typei = 1 then vi denotes a parent of a new vertex, while if typei = 2 then you should print the answer for a subtree rooted in vi.

It's guaranteed that there will be at least 1 query of the second type, that is, the output won't be empty.

It's guaranteed that just before the i-th query a vertex vi already exists.

Output

For each query of the second type print one real number —the expected value of the penalty if Limak attacks the given subtree. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct if <image>.

Examples

Input

7
1 1
1 1
2 1
1 2
1 3
2 2
2 1


Output

0.7500000000
0.5000000000
1.1875000000


Input

8
2 1
1 1
1 2
1 3
1 4
2 1
1 4
2 1


Output

0.0000000000
0.9375000000
0.9687500000

Note

Below, you can see the drawing for the first sample. Red circles denote queries of the second type.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void upmax(T& a, T b) {
  if (a < b) a = b;
}
template <class T>
inline void upmin(T& a, T b) {
  if (a > b) a = b;
}
const int maxn = 500007;
const int maxm = 500007;
const int mod = 1000000007;
const int inf = 0x7fffffff;
const double eps = 1e-7;
typedef int arr[maxn];
typedef int adj[maxm];
inline int fcmp(double a, double b) {
  if (fabs(a - b) <= eps) return 0;
  if (a < b - eps) return -1;
  return 1;
}
inline int add(int a, int b) { return ((long long)a + b) % mod; }
inline int mul(int a, int b) { return ((long long)a * b) % mod; }
inline int dec(int a, int b) { return add(a, mod - b % mod); }
inline int Pow(int a, int b) {
  int t = 1;
  while (b) {
    if (b & 1) t = mul(t, a);
    a = mul(a, a), b >>= 1;
  }
  return t;
}
template <typename Type>
inline Type RD() {
  Type x = 0;
  int flag = 0;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  (c == '-') ? (flag = 1) : (x = c - '0');
  while (isdigit(c = getchar())) x = x * 10 + c - '0';
  return flag ? -x : x;
}
inline char rdch() {
  char c = getchar();
  while (!isalpha(c)) c = getchar();
  return c;
}
const int MAX = 42;
arr head, to, nxt, st, dep, fa, ed;
int ett;
double f[maxn][MAX + 3];
inline void ins(int u, int v) {
  to[++ett] = v, nxt[ett] = head[u], head[u] = ett;
}
void dfs(int u) {
  static int dfs_clock = 0;
  st[u] = ++dfs_clock;
  for (int i = head[u]; i; i = nxt[i]) dep[to[i]] = dep[u] + 1, dfs(to[i]);
  ed[u] = dfs_clock;
}
int q, n;
pair<int, int> opr[maxm];
struct BIT {
  arr val;
  inline void upd(int u, int v) {
    while (u <= n) upmax(val[u], v), u += (u & (-u));
  }
  inline int get(int u) {
    int t = 0;
    while (u) upmax(t, val[u]), u -= (u & (-u));
    return t;
  }
} bit;
void input() {
  q = RD<int>(), n = 1;
  for (int i = 1, _ = q; i <= _; i++) {
    opr[i].first = RD<int>(), opr[i].second = RD<int>();
    if (opr[i].first == 1) {
      ++n;
      fa[n] = opr[i].second;
      ins(fa[n], n);
    }
  }
  dfs(1);
  for (int i = 1, _ = n; i <= _; i++)
    for (int d = 0, _ = MAX + 1; d <= _; d++) f[i][d] = 1;
}
double g[MAX + 3];
inline void add_node(int u, int p) {
  bit.upd(st[u], dep[u]);
  int t = p;
  for (int i = 0, _ = MAX; i <= _; i++) {
    g[i] = f[t][i];
    t = fa[t];
  }
  for (int i = 0, _ = MAX; i <= _; i++) {
    if (fa[p]) f[fa[p]][i + 1] /= (g[i] + 1) / 2;
    if (!i)
      f[p][0] /= 2;
    else
      f[p][i] *= (f[u][i - 1] + 1) / 2;
    if (!fa[p]) break;
    u = p, p = fa[p];
  }
}
inline void query(int u) {
  double ans = 0;
  int d = bit.get(ed[u]);
  ans = d * (d > MAX ? 1 : f[u][d]);
  if (d > MAX)
    ans -= d - 1 - MAX, d = MAX;
  else
    d--;
  for (int i = 0, _ = d; i <= _; i++) ans -= f[u][i];
  printf("%.8lf\n", ans);
}
int cur;
void solve() {
  cur = 1;
  for (int i = 1, _ = q; i <= _; i++) {
    if (opr[i].first == 1)
      add_node(++cur, opr[i].second);
    else
      query(opr[i].second);
  }
}
int main() {
  input();
  solve();
  return 0;
}