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 '#'.
import sys
input = sys.stdin.readline

n = int(input())
g = ['.'*(n+2)] + ['.' + input()[:-1] + '.' for _ in range(n)] + ['.'*(n+2)]
d = [(1,0),(1,-1),(1,1),(2,0)]
ans = 'YES'
s = []
for i in range(1, n+1):
    for j in range(1, n+1):
        if (i,j) not in s and g[i][j] == '#':
            for a,b in d:
                if g[i+a][j+b] != '#':
                    ans = 'NO'
                    break
            else:
                for a, b in d:
                    s.append((i+a, j+b))
                s.append((i, j))
    if ans == 'NO':
        break
print(ans)
