Problem: There are n cities and n - 1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads.

Theon and Yara Greyjoy are on a horse in the first city, they are starting traveling through the roads. But the weather is foggy, so they can’t see where the horse brings them. When the horse reaches a city (including the first one), it goes to one of the cities connected to the current city. But it is a strange horse, it only goes to cities in which they weren't before. In each such city, the horse goes with equal probabilities and it stops when there are no such cities. 

Let the length of each road be 1. The journey starts in the city 1. What is the expected length (expected value of length) of their journey? You can read about expected (average) value by the link <https://en.wikipedia.org/wiki/Expected_value>.

Input

The first line contains a single integer n (1 ≤ n ≤ 100000) — number of cities.

Then n - 1 lines follow. The i-th line of these lines contains two integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the cities connected by the i-th road.

It is guaranteed that one can reach any city from any other by the roads.

Output

Print a number — the expected length of their journey. The journey starts in the city 1.

Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if <image>.

Examples

Input

4
1 2
1 3
2 4


Output

1.500000000000000


Input

5
1 2
1 3
3 4
2 5


Output

2.000000000000000

Note

In the first sample, their journey may end in cities 3 or 4 with equal probability. The distance to city 3 is 1 and to city 4 is 2, so the expected length is 1.5.

In the second sample, their journey may end in city 4 or 5. The distance to the both cities is 2, so the expected length is 2.

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class Main
{
	static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }

    static Graph[] city;
    static boolean[] visit;

	public static void main (String[] args)
	{
		FastReader reader = new FastReader();
		int i, j, totalNodes = reader.nextInt();

		city = new Graph[totalNodes];
		visit = new boolean[totalNodes];

		for (i=0; i<totalNodes; i++)
			city[i] = new Graph();

		for (i=1; i<totalNodes; i++)
		{
			int node1 = reader.nextInt()-1;
			int node2 = reader.nextInt()-1;

			/*city[node1].list1.add (node2);
			city[node2].list1.add (node1);*/

			city[node1].list2.add (node2);
			city[node2].list2.add (node1);
		}

		/*long[] sum = new long[1];
		int[] leaves = new int[1];*/
		visit[0] = true;
		makeDfs (0);
		//visit[0] = true;

		if (totalNodes > 1)
		{
			/*double answer = sum[0];
			answer /= leaves[0];*/

			System.out.println (city[0].expectedValue);
		}
		else
			System.out.println (0);

		//System.out.println (city[1].expectedValue);
	}

	/*static void makeBfs (Graph[] city)
	{

	} 

	static void makeDfs (Graph[] city)
	{
		Stack<Integer> s = new Stack<Integer>();
		boolean[] visit = new boolean[city.length];

		visit[0] = true;
		s.push (0);

		while (!s.isEmpty())
		{
			int temp = s.peek();

			boolean pushed = false;
			while (!city[temp].list1.isEmpty())
			{	
				visit[city[temp].list1.peek()] = true;
				pushed = true;

				s.push (city[temp].list1.remove());
				break;
			}

			if (!pushed)
			{
				if (city[temp].list2.size() > 1 || temp == 0)
				{
					city[temp].expectedValue = 0;
					//int count = 0;
					for (int i=0; i<city[temp].list2.size(); i++)
					{
						if (city[city[temp].list2.get(i)].expectedValue != -1)	
							city[temp].expectedValue += city[city[temp].list2.get(i)].expectedValue;
					}

					if (temp > 0)
						city[temp].expectedValue /= city[temp].list2.size()-1;
					else
						city[temp].expectedValue /= city[temp].list2.size();
					
					city[temp].expectedValue += 1;
					//System.out.println ("dodobedubua");
				}
				else
					city[temp].expectedValue = 0;

				s.pop();
			}
		}

	}*/

	static void makeDfs (int node)
	{
		for (int i=0; i<city[node].list2.size(); i++)
		{
			if (!visit[city[node].list2.get(i)])
			{
				visit[city[node].list2.get(i)] = true;
				makeDfs (city[node].list2.get(i));

				city[node].expectedValue += city[city[node].list2.get(i)].expectedValue;

			}
		}

		if (node > 0)
		{
			if (city[node].list2.size() > 1)
			{
				city[node].expectedValue /= city[node].list2.size()-1;
				city[node].expectedValue += 1;
			}
			else
				city[node].expectedValue = 0;
		}
		else
		{
			city[node].expectedValue /= city[node].list2.size();
			city[node].expectedValue += 1;

			//System.out.println ("rec " + city[0].expectedValue);
		}
	} 
}

class Graph
{
	double expectedValue = 0;
	//Queue<Integer> list1 = new LinkedList<Integer>();
	ArrayList<Integer> list2 = new ArrayList<Integer>();
}