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 = []
sm = 0
for i in range(n):
    s = input()
    sm += s.count('#')
    s = [x for x in s]
    a.append(s)
#print(a)
if sm % 5 != 0:
    print('NO')
else:
    rez = 'NO'
    for i in range(1, n - 1):
        for j in range(1, n - 1):
            x1 = a[i][j + 1]
            x_1 = a[i][j - 1]
            y1 = a[i + 1][j]
            y_1 = a[i - 1][j]
            f = (a[i][j] == '#') and (x1 == '#') and (x_1 == '#')
            f = f and (y1 == '#') and (y_1 == '#')
            if f:
                a[i][j + 1] = '.'
                a[i][j - 1] = '.'
                a[i + 1][j] = '.'
                a[i - 1][j] = '.'
                a[i][j] = '.'

    for i in a:
        a_s = set(i)
    if len(a_s) > 1:
        print('NO')
    else:
        print("YES")