Problem: There are N balls and N+1 holes in a line. Balls are numbered 1 through N from left to right. Holes are numbered 1 through N+1 from left to right. The i-th ball is located between the i-th hole and (i+1)-th hole. We denote the distance between neighboring items (one ball and one hole) from left to right as d_i (1 \leq i \leq 2 \times N). You are given two parameters d_1 and x. d_i - d_{i-1} is equal to x for all i (2 \leq i \leq 2 \times N).

We want to push all N balls into holes one by one. When a ball rolls over a hole, the ball will drop into the hole if there is no ball in the hole yet. Otherwise, the ball will pass this hole and continue to roll. (In any scenario considered in this problem, balls will never collide.)

In each step, we will choose one of the remaining balls uniformly at random and then choose a direction (either left or right) uniformly at random and push the ball in this direction. Please calculate the expected total distance rolled by all balls during this process.

For example, when N = 3, d_1 = 1, and x = 1, the following is one possible scenario:

c9264131788434ac062635a675a785e3.jpg

* first step: push the ball numbered 2 to its left, it will drop into the hole numbered 2. The distance rolled is 3.
* second step: push the ball numbered 1 to its right, it will pass the hole numbered 2 and drop into the hole numbered 3. The distance rolled is 9.
* third step: push the ball numbered 3 to its right, it will drop into the hole numbered 4. The distance rolled is 6.



So the total distance in this scenario is 18.

Note that in all scenarios every ball will drop into some hole and there will be a hole containing no ball in the end.

Constraints

* 1 \leq N \leq 200,000
* 1 \leq d_1 \leq 100
* 0 \leq x \leq 100
* All input values are integers.

Input

The input is given from Standard Input in the following format:


N d_1 x


Output

Print a floating number denoting the answer. The relative or absolute error of your answer should not be higher than 10^{-9}.

Examples

Input

1 3 3


Output

4.500000000000000


Input

2 1 0


Output

2.500000000000000


Input

1000 100 100


Output

649620280.957660079002380

Solution (in CPP):

Solution:
/*
n个球的情况移动一个球后变成n-1个球的情况，且问题形式完全相同
计算出这次移动对答案的贡献
考虑计算新情况中每条边的期望长度，即可正确统计答案，把问题转化成子问题！！！
原图中边是等差数列-->新图中边也是等差数列
递归至n=1即可
*/
#include<cstdio>
#include<cstring>
#define ld long double
using namespace std;
int n, d, x;
ld ans;
inline void solve(int n, ld d, ld x){
	ans+=d+(2*n-1)*x/2; if(n==1)return;
	solve(n-1, (ld)(n+1)/n*d+(ld)5/(2*n)*x, (ld)(n+2)/n*x);
}
int main(){
	scanf("%d%d%d", &n, &d, &x);
	ans=0; solve(n, d, x); printf("%.15Lf", ans);
	return 0;
}