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 deleteCross(m, i, j):
    if i<=0 or j<=0 or i>=len(m)-1 or j>=len(m)-1: return (m,False)
    if m[i][j] == '#' and m[i+1][j] == '#' and m[i-1][j] == '#' and m[i][j+1] == '#' and m[i][j-1] == '#':
        m[i][j] = m[i+1][j] = m[i-1][j] = m[i][j+1] = m[i][j-1] = '.'
        return (m, True)
    return (m, False)

def solve(m):
    for i in range(len(m)):
        for j in range(len(m)):
            if m[i][j] == '#':
                r1 = deleteCross(m, i+1, j)
                if not r1[1]: return False
                m = r1[0]
    return True

n = int(input())
m = []
for i in range(n):
    m.append(list(raw_input()))
print('YES' if solve(m) else 'NO')
