Problem Description

You are a skilled adventurer who has overcome numerous trials and acquired numerous treasures through your adventures. You decided to store these in the treasure vault at the back of a hidden dungeon, guarded by Cerberus and the monster Kusari-gashira. The hidden dungeon is a $10 \times 10$ space, where all 10 squares on the left side are connected to the entrance of the dungeon, and all 10 squares on the right side are connected to the treasure vault.

..........
..........
..........
..........
..........
..........
..........
..........
..........
..........

Currently, the hidden dungeon is empty. Foolhardy intruders aiming for the treasure will enter from any of the squares on the left side and aim for any of the squares on the right side. As soon as an intruder enters the hidden dungeon, Cerberus will chase them from the left, so the intruder can only move to the upper-right, right, or lower-right squares. They also cannot move outside the $10 \times 10$ space. You decided to place many Kusari-gashira in the hidden dungeon to block intruders. Kusari-gashira have the following characteristics:

• Kusari-gashira cannot move.
• Kusari-gashira can launch a fatal attack from their square to any square within 2 squares in any direction (vertical, horizontal, or diagonal).

If a Kusari-gashira is placed at a location marked with C, its attackable range is represented by X as follows. An intruder who steps into any of the marked C or X squares will be incapacitated.

.......
.X.X.X.
..XXX..
.XXCXX.
..XXX..
.X.X.X.
.......

Filling the hidden dungeon with Kusari-gashira would ensure that all intruders are eliminated, but you feel that would be uninteresting. Instead, you decided to place Kusari-gashira such that there is exactly one route from the start to the goal without being attacked by Kusari-gashira, and you will reward any intruder who successfully navigates this route with a part of the treasure.

Hiring Kusari-gashira is expensive. You are also frugal and want to hire as few Kusari-gashira as possible. While hiring more than the minimum won't result in a wrong answer, it may not guarantee full points. Check the partial scoring constraints for details. Output one configuration where the path from the left to the right is uniquely determined.

Input Format

There is no input for this problem.

Output Format

Output the $10 \times 10$ hidden dungeon board. C indicates that a Kusari-gashira is placed there, and . indicates that it is empty. Note: C must be uppercase. Be careful that any output containing characters other than these two and newline will be considered not meeting the problem's conditions.

Sample Input and Output

Sample Input #1

None

Sample Output #1

CCCCCCCCCC
CCCCCCCCCC
..........
..........
..........
..........
..........
CCCCCCCCCC
CCCCCCCCCC
CCCCCCCCCC

Sample Input #2

None

Sample Output #2

CCCCC.C...
CCCC.C....
CCC.C.....
CC.C.....C
C.C.....C.
.C.....C.C
C.....C.CC
.....C.CCC
....C.CCCC
...C.CCCCC

Sample Input #3

None

Sample Output #3

CCCCCCCCCC
CCCCCCCCCC
..........
..........
..........
..........
..........
CC.....CCC
CCCCCCCCCC
CCCCCCCCCC

Sample Input #4

None

Sample Output #4

CCCCCCCCCC
..........
..........
..........
.C........
..........
..........
.C........
..........
..........

Notes/Hints

Partial Points

This problem has partial scoring. The scoring is as follows:

• If the board uniquely determines a path from the left to the right, it will be judged as Accepted, and you will be awarded $floor(400 / (max(4, N-1)))$ points when $N$ Kusari-gashira are placed.
• Otherwise, it will be judged as Wrong Answer, and no points will be awarded.
• Note: For system reasons, if you receive $X$ points for an Accepted solution, all previously submitted Accepted solutions with less than $X$ points will be counted as wrong answers and incur penalties.

Hint

• A solution with $N = 5$ can earn full points, but there exists a solution with $N = 4$.

Sample Explanation 1

There is only one path from the left to the right, and 50 Kusari-gashira are placed. If this board is submitted, 8 points will be awarded.

Sample Explanation 2

There is only one path from the left to the right, and 44 Kusari-gashira are placed. If this board is submitted, 9 points will be awarded.

Sample Explanation 3

In this board, the path from the left to the right is not uniquely determined. There are routes that go straight right and routes that move slightly down before moving up again. If submitted, it will be judged as Wrong Answer, and no points will be awarded.

Sample Explanation 4

In this board, there is no path from the left to the right. Note that intruders cannot step on C squares and cannot move outside the $10 \times 10$ space. If submitted, it will be judged as Wrong Answer, and no points will be awarded.

见题面 Input 部分

见题面 Output 部分