Fox Ciel has a board with *n* rows and *n* columns. So, the board consists of *n* × *n* cells. Each cell contains either a symbol '.', or a symbol '#'.

A cross on the board is a connected set of exactly five cells of the board that looks like a cross. The picture below shows how it looks.

Ciel wants to draw several (may be zero) crosses on the board. Each cross must cover exactly five cells with symbols '#', and any cell with symbol '#' must belong to some cross. No two crosses can share a cell.

Please, tell Ciel if she can draw the crosses in the described way.
The first line contains an integer *n* (3 ≤ *n* ≤ 100) — the size of the board.

Each of the next *n* lines describes one row of the board. The *i*-th line describes the *i*-th row of the board and consists of *n* characters. Each character is either a symbol '.', or a symbol '#'.
num_lines = int(input())

lines = []
hash_count = 0

for i in range(num_lines):
    tmp = input()
    lines.append([i for i in tmp])
    hash_count = hash_count + tmp.count("#")

for i in range(len(lines)):
    for j in range(len(lines[i])):
        if lines[i][j] == "#":
                try:
                    if lines[i + 1][j - 1] == "#" and lines[i + 1][j] == "#" and lines[i + 1][j + 1] == "#" and \
                                    lines[i + 1][j] == "#":
                        lines[i + 1][j - 1] = "."
                        lines[i + 1][j] = "."
                        lines[i + 1][j + 1] = "."
                        lines[i + 1][j] = "."
                        hash_count = hash_count - 5
                except:
                    pass

if hash_count == 0:
    print("YES")
else:
    print("NO")





