A. Parking
time limit per test
0.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

The street in front of you has some empty parking spots. A car needs 1 parking spot to park; an SUV needs 2 parking spots; and an 18-wheeler truck needs 4. Some parking spots are already taken. Given a description of the parking spots that are free and taken in the street currently, compute in how many different ways you can fill up the street with vehicles (cars, SUVs, or 18-wheelers).

For instance, in the following street, where a dash (-) means an empty spot and an X means a spot already taken,

- X X - - X - - - - X
there are exactly 12 different ways of parking vehicles in the 7 empty parking spots. These are just 4 of these ways, where c is a car, sss is an SUV, and ttttttt is an 18-wheeler.
c X X c c X c c c c X c X X sss X c c c c X c X X c c X c sss c X c X X sss X ttttttt X
Input

The input consists of an arbitrary number of lines. Every line is a non-empty string with symbols - or X. No line will be larger than 70 symbols.

Output

For each input case, output a line with the total number of different configurations. No output will be larger than $$$10^{18}$$$.

Examples
Input
-
X
--
-X
XX
---
----
Output
1
1
2
1
1
3
6
Input
-XX--X----X
---X--XX--------X-X---XXXXXXXX-XX
---------------------------------
-X-X-X--X-X-X-X-X-X-X-X-X-X-X-X-X
Output
12
990
69988378
2