Rikka is a talented student.
She likes to wander in the corridor while solving ICPC problems. Specifically, she will do a random walk for n steps. In the i-th random step, she will choose one of the vectors (x,y) such that x,y∈R and x2+y2≤R_i2 with equal probability. And then she will walk along the vector. In other words, if she stood at (A,B) before the random step, she will stand at (A+x,B+y) afterwards. Before wandering, she stands at the door (0,0).
After wandering, she was curious about the expectation of the square of Euclidean distance to point (0,0). In other words, she wants to know the expected value of x2+y2, if she stands at (x,y) after all n random steps.
The first line contains an integer n, the number of random steps.
The second line contains n positive integers R_i, the parameter of the i-th random step.
It is guaranteed that 1≤n≤50,000 and 1≤R_i≤1000.
You need to output d, the expected value of x2+y2. Assuming the correct result is d\*, you need to ensure that maxd\*,1∣d−d\*∣≤10−6.