#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.1415926535897932384626;
const long long int MOD = 1000000000 + 7;
const int INF = 0x3f3f3f3f;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
long long int Nmul(long long int A, long long int B) {
  long long int ret = (long long int)((long long int)(A) * (long long int)(B));
  return ret;
}
long long int Mmul(long long int a, long long int b, long long int mod) {
  long long int c = Nmul(a, b);
  c %= mod;
  while (c < 0) {
    c += mod;
  };
  return c;
}
long long int Nadd(long long int A, long long int B) {
  long long int ret = (long long int)((long long int)(A) + (long long int)(B));
  return ret;
}
long long int Madd(long long int a, long long int b, long long int mod) {
  long long int c = Nadd(a, b);
  while (c >= mod) {
    c -= mod;
  };
  while (c < 0) {
    c += mod;
  };
  return c;
}
long long int Nsub(long long int A, long long int B) {
  long long int ret = (long long int)((long long int)(A) - (long long int)(B));
  return ret;
}
long long int Msub(long long int a, long long int b, long long int mod) {
  return Madd(a, mod - b, mod);
}
long long int Npow(long long int A, long long int p) {
  long long int ret = 1;
  while (p) {
    if (p & 1) {
      ret = (ret * A);
    }
    A = (A * A);
    p >>= 1;
  }
  return ret;
}
long long int Mpow(long long int a, long long int n, long long int b) {
  long long int res = 1;
  while (n) {
    if (n & 1) {
      res = Mmul(res, a, b);
    }
    a = Mmul(a, a, b);
    n >>= 1;
  }
  return Madd(res, 0, b);
}
long long int Ndiv(double A, double B, bool ud) {
  if (B) {
    double ret = (double)(A) / (double)(B);
    if (ud) return ceil(ret);
    return floor(ret);
  }
  return INF;
}
long long int Mdiv(long long int a, long long int b, long long int mod) {
  long long int ans = Mmul(a, Mpow(b, mod - 2, mod), mod);
  return ans;
}
int n;
std::vector<int> vi[100005 + 1];
int sub[100005 + 1];
int dep[100005 + 1];
double ans[100005 + 1];
void dfs(int u) {
  for (int i : vi[u]) {
    dep[i] = dep[u] + 1;
    dfs(i);
    sub[u] += sub[i] + 1;
  }
}
int main(int argc, char const* argv[]) {
  scanf("%d", &n);
  for (int i = 2; i <= n; i++) {
    int val;
    scanf("%d", &val);
    vi[val].push_back(i);
  }
  dfs(1);
  for (int i = 1; i <= n; i++) {
    ans[i] = dep[i] + 1 + (double)(n - sub[i] - dep[i] - 1) * (double)(0.5);
  }
  cout << fixed << setprecision(7);
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  printf("\n");
  return 0;
}
