#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c *x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug &operator<<(const c &) {
    return *this;
  }
};
using ii = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using ld = long double;
const int inf = 0x3f3f3f3f;
const ll linf = 0x3f3f3f3f3f3f3f3fll;
template <typename T>
T abs(T x) {
  return x < 0 ? -x : x;
}
template <typename T>
void max_self(T &a, T b) {
  a = max(a, b);
}
template <typename T>
void min_self(T &a, T b) {
  a = min(a, b);
}
const int MAX = 1e5 + 10;
vi adj[MAX];
vi depth, sub;
void dfs(int u = 0, int p = -1) {
  sub[u] = 1;
  for (auto v : adj[u]) {
    if (v == p) continue;
    depth[v] = depth[u] + 1;
    dfs(v);
    sub[u] += sub[v];
  }
}
void solve(int tc) {
  int n, x;
  cin >> n;
  depth.resize(n + 1);
  sub.resize(n + 1);
  for (int i = 1; i < n; ++i) {
    cin >> x;
    adj[--x].push_back(i);
  }
  depth[0] = 1;
  dfs();
  for (int i = 0; i < n; ++i) {
    if (i) cout << " ";
    double ans = (double)(n - (sub[i] - 1) - depth[i]) / 2 + depth[i];
    cout << std::fixed << std::setprecision((12)) << (ans);
    ;
  }
}
int main() {
  int tc = 1;
  ios::sync_with_stdio(false);
  cin.tie(0);
  for (int i = 1; i <= tc; ++i) {
    solve(i);
  }
  return 0;
}
