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 '#'.
from sys import stdin ,stdout 
input=stdin.readline
def print(*args, end='\n', sep=' ') -> None:
    stdout.write(sep.join(map(str, args)) + end)

def vaild(x,y):
    return 0<=x<n and 0<=y<n and arr[x][y]=="#"

def check(r,c):
    ind=[(r+1,c),(r+2,c),(r+1,c-1),(r+1,c+1)]
    for i in ind:
        x,y=i
        if not vaild(x,y):
            return False
        arr[x][y]="x"
    return True

n=int(input()) ; arr=[] ; ans=False
for i in range(n):
    s=list(input().strip()) ; arr.append(s)

for i in range(n):
    for j in range(n):
        if arr[i][j]=="#":
            if not check(i,j):
                print("NO") ;ans=True; break
    if ans:
        break
else:
    print("YES")
