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 '#'.
mod = 1000000007
ii = lambda : int(input())
si = lambda : input()
dgl = lambda : list(map(int, input()))
f = lambda : map(int, input().split())
il = lambda : list(map(int, input().split()))
ls = lambda : list(input())
n=ii()
l=[]
c=0
c1=0
for _ in range(n):
    x=ls()
    c+=x.count('#')
    l.append(x)
for i in range(1,n-1):
    for j in range(1,n-1):
        if l[i][j]+l[i-1][j]+l[i+1][j]+l[i][j-1]+l[i][j+1]=='#####':
            l[i][j]='.'
            l[i-1][j]='.'
            l[i+1][j]='.'
            l[i][j-1]='.'
            l[i][j+1]='.'
            c1+=5
print('YNEOS'[c1!=c::2])