Author:  NEERC 2016  Time limit:  2 sec  
Input file:  input.txt  Memory limit:  512 Mb  
Output file:  output.txt 
Fedor is an avid traveler. As a result of his hobby, he has gathered a big collection of postcards from all over the world. Each postcard has a unique picture on the front side and some fields for address information and text on the back side.
During one of the parties at Fedor's house, he decided to show all his of postcards to the guests. To achieve that, he wants to lay them all out on the table. Initially, all of his postcards are arranged in a single stack that Fedor is holding in his hands. Unfortunately, some of the postcards in that stack can be turned incorrectly — upside down. Ideally, Fedor would like all postcards on the table to lie with the picture on top, but looking at every postcard and turning it over individually can be very timeconsuming. Instead, he came up with the following process:
Of course, after all the postcards are on the table, there might still be some that lie back side up. What is the expected number of such postcards?
The input consists of a single line of «C» and «W» characters — ith character corresponds to ith postcard in the stack, counting from the top of the stack. «C» means that ith postcard is oriented correctly in the initial stack, and «W» means that ith postcard is oriented in the wrong way. The number of characters is between 1 and 10^{6} inclusive.
Output one real number — the expected number of incorrectly placed postcards on the table. The absolute or relative error should not exceed 10^{−9}.
No.  Input file (input.txt ) 
Output file (output.txt ) 

1 


2 

