//

 //by coolxxx

 ////<bits/stdc++.h>

 #include<iostream>

 #include<algorithm>

 #include<string>

 #include<iomanip>

 #include<memory.h>

 #include<time.h>

 #include<stdio.h>

 #include<stdlib.h>

 #include<string.h>

 //#include<stdbool.h>

 #include<math.h>

 #define min(a,b) ((a)<(b)?(a):(b))

 #define max(a,b) ((a)>(b)?(a):(b))

 #define abs(a) ((a)>0?(a):(-(a)))

 #define lowbit(a) (a&(-a))

 #define sqr(a) ((a)*(a))

 #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))

 #define mem(a,b) memset(a,b,sizeof(a))

 #define eps (1e-8)

 #define J 10

 #define MAX 0x7f7f7f7f

 #define PI 3.14159265358979323

 #define N 100004

 using namespace std;

 typedef long long LL;

 int cas,cass;

 int n,m,lll,ans;

 int fa[N],s[N],last[N];

 double c[N];

 struct xxx

 {

     int next,to;

 }a[N];

 void add(int x,int y)

 {

     a[++lll].next=last[x];

     a[lll].to=y;

     last[x]=lll;

 }

 void cal(int u)

 {

     int i,v;

     for(i=last[u];i;i=a[i].next)

     {

         v=a[i].to;

         cal(v);

         s[u]+=s[v];

     }

     s[u]++;

 }

 void dfs(int u)

 {

     int i,v;

     for(i=last[u];i;i=a[i].next)

     {

         v=a[i].to;

         c[v]=c[u]+(s[u]-s[v]-)*0.5+;

         dfs(v);

     }

 }

 void print()

 {

     int i;

     for(i=;i<=n;i++)

     {

         printf("%d ",s[i]);

     }

     puts("");

 }

 int main()

 {

     #ifndef ONLINE_JUDGE

     freopen("1.txt","r",stdin);

 //    freopen("2.txt","w",stdout);

     #endif

     int i,j;

 //    for(scanf("%d",&cas);cas;cas--)

 //    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)

 //    while(~scanf("%s",s))

     while(~scanf("%d",&n))

     {

         mem(s,);mem(last,);lll=;

         for(i=;i<=n;i++)

         {

             scanf("%d",&fa[i]);

             add(fa[i],i);

         }

         cal();

         c[]=1.0;

         dfs();

         for(i=;i<=n;i++)

             printf("%.1lf ",c[i]);

         puts("");

     }

     return ;

 }

 /*

 //

 //

 */