Problem: Barney lives in country USC (United States of Charzeh). USC has n cities numbered from 1 through n and n - 1 roads between them. Cities and roads of USC form a rooted tree (Barney's not sure why it is rooted). Root of the tree is the city number 1. Thus if one will start his journey from city 1, he can visit any city he wants by following roads.

<image>

Some girl has stolen Barney's heart, and Barney wants to find her. He starts looking for in the root of the tree and (since he is Barney Stinson not a random guy), he uses a random DFS to search in the cities. A pseudo code of this algorithm is as follows:
    
    
      
    let starting_time be an array of length n  
    current_time = 0  
    dfs(v):  
    	current_time = current_time + 1  
    	starting_time[v] = current_time  
    	shuffle children[v] randomly (each permutation with equal possibility)  
    	// children[v] is vector of children cities of city v  
    	for u in children[v]:  
    		dfs(u)  
    

As told before, Barney will start his journey in the root of the tree (equivalent to call dfs(1)).

Now Barney needs to pack a backpack and so he wants to know more about his upcoming journey: for every city i, Barney wants to know the expected value of starting_time[i]. He's a friend of Jon Snow and knows nothing, that's why he asked for your help.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 105) — the number of cities in USC.

The second line contains n - 1 integers p2, p3, ..., pn (1 ≤ pi < i), where pi is the number of the parent city of city number i in the tree, meaning there is a road between cities numbered pi and i in USC.

Output

In the first and only line of output print n numbers, where i-th number is the expected value of starting_time[i].

Your answer for each city will be considered correct if its absolute or relative error does not exceed 10 - 6.

Examples

Input

7
1 2 1 1 4 4


Output

1.0 4.0 5.0 3.5 4.5 5.0 5.0 


Input

12
1 1 2 2 4 4 3 3 1 10 8


Output

1.0 5.0 5.5 6.5 7.5 8.0 8.0 7.0 7.5 6.5 7.5 8.0 

Solution (in JAVA):

Solution:
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class quest4 {
    static List<List<Integer>> children;
    static List<Integer> topsort;
    static boolean[] visited;
    static int[] count;

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        children = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            children.add(new ArrayList<Integer>());
        }
        for (int i = 1; i < n; i++) {
            children.get(input.nextInt() - 1).add(i);
        }
//        System.out.println(children);
        topsort = new ArrayList<>();
        visited = new boolean[n];
        count = new int[n];
        dfs(0);
//        System.out.println(topsort);
        double[] ans = new double[n];
//        System.out.println("count:" + Arrays.toString(count));
        ans[0] = 1;
        for (int i = n - 1; i >= 0; i--) {
            int k = topsort.get(i);
            int s = 0;
            for (int child: children.get(k)) {
                s += count[child];
            }
            for (int child: children.get(k)) {
                ans[child] = ans[k] + (double) (s - count[child]) / 2.0 + 1.0;
            }
        }
        for (int i = 0; i < n; i++) {
            System.out.print(ans[i]);
            if (i != n - 1) {
                System.out.print(" ");
            }
        }
        System.out.println();
    }

    static int dfs(int n) {
        if (visited[n]) return count[n];
        visited[n] = true;
        int c = 1;
        for (int ne: children.get(n)) {
            c += dfs(ne);
        }
        topsort.add(n);
        count[n] = c;
        return c;
    }
}