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 '#'.
def cross(n, lst):
    for i in range(n):
        for j in range(n):
            if lst[i][j] == '#':
                if i < n - 2 and 1 <= j <= n - 2 and lst[i + 1][j - 1] == '#' and lst[i + 1][j] == '#' and lst[i + 1][
                    j + 1] == '#' and lst[i + 2][j] == '#':
                    lst[i][j] = '.'
                    lst[i + 1][j - 1] = '.'
                    lst[i + 1][j] = '.'
                    lst[i + 1][j + 1] = '.'
                    lst[i + 2][j] = '.'
                else:
                    return "NO"
    return "YES"


N = int(input())
a = list()
for y in range(N):
    b = [x for x in input().split()]
    a.append(list(b))
print(cross(N, a))
