Migrated from Lutece 797 Eh? Beautiful Stone!

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

Captain Chen lives in two dimensional plane, so the stone he believes is a convex polygon.

Captain Chen loves stones, and he has a special rule to judge how beautiful a stone is.

The rule is quite simple, the longer the visible part of the perimeter is, the more beautiful the stone is.

Now Captain Chen wonders what is the length of the visible part of the perimeter of the stone.

Input

The first line of the input contains one integer $N$ ($3\leq N\leq 10^4$), meaning the number of point in the polygon.

Each of the next N lines contains two real numbers $x_{i}, y_{i}$ ($-10^4\leq x, y\leq 10^4$), meaning the coordinate of the point. The points of the polygon are given in anticlockwise.

The last line contains two real numbers $x, y$ ($-10^4\leq x, y\leq 10^4$), meaning the position of Captain Chen.

Output

Output the length Captain Chen can see, rounded to $0.001$

Samples

4
-1.0 0.0
1.0 0.0
1.0 1.0
-1.0 1.0
0 2

2.000

Note

It is guaranteed that Captain Chen will not stand in the stone.

The image for the sample input, the perimeter Captain Chen can see is the line $AB$.

Resources

the 12th UESTC Programming Contest Preliminary