Football
Time Limit: 1 Second Memory Limit: 32768 KB
Eric has a classic football that is made of 32 pieces of leather: 12 black pentagons and 20 white hexagons. Each pentagon adjoins 5 hexagons and each hexagon adjoins 3 pentagons and 3 hexagons. Eric drew a polygon (i.e. a closed line without intersections) along the edges of the pieces. The polygon divided the ball into two parts and Eric painted one of them green.
He is curious if given a description of the polygon you are able to compute the number of black, white and green pieces?
Task
Write a program that:
- reads the description of a polygon,
- computes the number of black, white and green pieces,
- writes the result.
Input
The input consists of several test cases.
For each case, the first line contains one integer N being the number of vertices of the polygon. The second
line contains N integers a1, a2, ..., aN separated by single spaces. Integer ai (equal 1 or 2) is
the number of green pieces adjoining the i-th vertex of the polygon. The side of the polygon connecting
the N-th and the first vertex always lies between two hexagons.
Output
For each test case, print in one line three integers B, W and G -- the number of black, white and green pieces respectively.
Sample Input
21 1 2 1 2 1 2 1 1 1 2 2 1 1 1 1 2 2 2 1 1 1
Sample Output
11 15 6Submit
Source: Central Europe 2003