{"raw_statement":[{"iden":"problem statement","content":"There is an undirected connected graph with $N$ vertices and $N-1$ edges. The $i$\\-th edge connects $u_i$ and $v_i$.  \n  \nE869120 the coder moves in the graph as follows:  \n\n*   He move to adjacent vertex, but he can't a visit vertex two or more times.\n*   He ends move when there is no way to move.\n*   Otherwise, he moves randomly. (equal probability) If he has $p$ way to move this turn, he choose each vertex with $1/p$ probability.\n\n![image](https://atcoder.jp/img/s8pc-4/5973dad11843e9098d9225dd431c9084.png)\n\nCalculate the expected value of the number of turns, when E869120 starts from vertex $i$, for all $i (1 ≤ i ≤ N)$."},{"iden":"input","content":"The input is given from standard input in the following format.  \n  \n\n$N$\n$u_1$ $v_1$\n$u_2$ $v_2$\n :\n$u_{N-1}$ $v_{N-1}$"},{"iden":"sample input 1","content":"4\n1 2\n2 3\n2 4"},{"iden":"sample output 1","content":"2.0\n1.0\n2.0\n2.0"},{"iden":"sample output 2","content":"3.0\n1.5\n3.0\n1.5"},{"iden":"sample output 3","content":"4.0\n2.0\n2.0\n2.0\n4.0"},{"iden":"sample output 4","content":"2.000000000000\n1.666666666667\n1.666666666667\n3.000000000000\n3.000000000000\n3.000000000000\n3.000000000000"},{"iden":"sample output 5","content":"3.666666666667\n2.250000000000\n3.666666666667\n2.833333333333\n2.555555555556\n2.666666666667\n4.333333333333\n2.666666666667\n5.333333333333\n2.500000000000\n2.500000000000\n5.000000000000"},{"iden":"sample output 6","content":"1.0\n1.0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}