Sea Battle#4395
After a successful raid in Li-El Bay, the Airfooted Bison and Swift Monkey tribes captured a squadron of the latest Sudislav military ships. However, the ship crews managed to escape with the uranium rods, leaving the ships immobile.
All the ships were already divided into two equal groups, each stationed in a separate bay. Each bay is shaped as a square with a side length of kilometer, divided into 100 identical squares of 100 \times 100 meters. The following classes of ships exist:
Battleships: meters wide and meters long;
Dreadnoughts: 100 \times 300 meters;
Destroyers: 100 \times 200 meters;
Ekranoplanes: 100 \times 100 meters.
With the ships' arsenals fully stocked, the chiefs decided to hold combat exercises between the groups the next morning, taking turns firing in an arc into the enemy bay. The Cunning Monkey dispatched a squad of warriors in canoes to scout the positions of enemy ships in the bay.
The scouts discovered that each of the squares in the bay is either absolutely empty, or completely filled by a ship or its part. Furthermore, no two squares with ships touch each other, neither by side nor by corner. The scouts marked what was present in each square, but along the way, their map got wet and some markings disappeared. Now, ashamed to return with such meager results, they ask you to find the greatest possible length of a ship that is not completely marked on the map and could possibly be present in the bay.
The input consists of the Monkey's map — a 10 \times 10 matrix. Each element of the matrix corresponds to a square in the bay and contains a symbol:
' ' (space) — if the information about that square was lost;
'.' — if the square was explored and found to be empty;
'*' — if the square was explored and part of a ship was found in it.
It is guaranteed that there is at least one ship that is not completely marked.
In the first line, output a single integer — the maximum possible length in meters of a ship not completely marked on the map and possibly present in the enemy's training bay. In the following lines, output the Monkey's map in the same format as the input file, but with the possible placement of such a ship (of the determined length) added using '*' symbols. If there are several possible solutions, you may output any one of them.
Example 1