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 '#'.
n = int(input())

a = []

for i in range(n):
    a.append(list(input()))

def check_range(i, j):
    if j - 1 >= 0 and j + 1 < n and i + 2 < n:
        if a[i+1][j-1] == 'X' or a[i+1][j+1] == 'X' or a[i+1][j] == 'X' or a[i+2][j] == 'X':
            return False
        return True
    else:
        return False

res = True

for i in range(n):
    for j in range(n):
        if a[i][j] == '#':
            if check_range(i, j):
                a[i][j] = 'X'
                a[i+1][j-1] = 'X'
                a[i+1][j] = 'X'
                a[i+1][j+1] = 'X'
                a[i+2][j] = 'X'
            else:
                res = False
                break

if res:
    print("YES")
else:
    print("NO")

