Jenga

You are writing a program that plays Jenga, and the first thing it needs is a way to tell which towers are still up. Given several Jenga towers, decide for each one whether it is standing or has fallen.

A tower falls when two horizontally adjacent blocks in the same row are both missing. Gaps that sit above one another in the same column do not count. The top row is no exception: two adjacent missing blocks in the top row also make the tower fall.

The first line contains the number of test cases.

Each test case begins with a single integer, the height of the Jenga tower. The next lines give the state of one row each. Every row is three characters long, where 1 is a block that is still in place and 0 is a block that has been pulled out.

There are between 1 and 100 test cases, and each tower has a height between 1 and 20.

For each test case, print Case x: on a line of its own, where x is the case number, then a single space, then Fallen if the tower has fallen or Standing if it is still up.