#include <bits/stdc++.h>
using namespace std;
const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dc[] = {0, 1, 0, -1, 1, -1, -1, 1};
const double eps = 1e-9;
const int INF = 0x7FFFFFFF;
const long long INFLL = 0x7FFFFFFFFFFFFFFFLL;
const double pi = acos(-1);
template <class T>
T take(queue<T>& O) {
  T tmp = O.front();
  O.pop();
  return tmp;
}
template <class T>
T take(stack<T>& O) {
  T tmp = O.top();
  O.pop();
  return tmp;
}
template <class T>
T take(priority_queue<T>& O) {
  T tmp = O.top();
  O.pop();
  return tmp;
}
template <class T>
inline void getint(T& num) {
  bool neg = 0;
  num = 0;
  char c;
  while ((c = getchar_unlocked()) && (!isdigit(c) && c != '-'))
    ;
  if (c == '-') {
    neg = 1;
    c = getchar_unlocked();
  }
  do num = num * 10 + c - '0';
  while ((c = getchar_unlocked()) && isdigit(c));
  if (neg) num = -num;
}
template <class T>
inline bool inRange(T z, T a, T b) {
  return a <= z && z <= b;
}
void OPEN(string in = "input.txt", string out = "output.txt") {
  freopen(in.c_str(), "r", stdin);
  freopen(out.c_str(), "w", stdout);
  return;
}
double ans[100005];
double tmp[100005], facto[100005];
double tmp2[100005];
int n, sz[100005];
vector<int> adj[100005];
void dfs(int u) {
  for (const auto& v : adj[u]) {
    dfs(v);
    sz[u] += sz[v];
  }
  ++sz[u];
}
void dfsitung(int u) {
  int anak = (int)adj[u].size();
  double tot = 0.0;
  for (const auto& v : adj[u]) tot += sz[v];
  for (const auto& v : adj[u]) tmp[v] = (tot - sz[v]);
  double pengali = 0.5;
  for (const auto& v : adj[u]) ans[v] = ans[u] + tmp[v] * pengali + 1.0;
  for (auto v : adj[u]) dfsitung(v);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ;
  facto[0] = 1.0;
  for (int(i) = (1), _t = (100005); i < (_t); ++(i))
    facto[i] = facto[i - 1] * i;
  cin >> n;
  for (int(i) = (1), _t = (n); i < (_t); ++(i)) {
    int ayah;
    cin >> ayah;
    --ayah;
    adj[ayah].push_back(i);
  }
  dfs(0);
  ans[0] = 1.0;
  dfsitung(0);
  for (int(i) = (0), _t = (n); i < (_t); ++(i))
    cout << fixed << setprecision(10) << ans[i] << " \n"[i == n - 1 ? 1 : 0];
}
