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 collections import Counter
def solve():
    n=int(input());a=[]
    for r in range(n):s=list(input());a.append(s)
    for r in range(n):

        for c in range (n):

            if (a[r][c]=='#' and (c==0 or c==n-1)) or (a[r][c]=='#' and r>=n-2):print("NO");return

            if a[r][c]=="#":

                if a[r][c]==a[r+1][c]==a[r+1][c-1]==a[r+1][c+1]==a[r+2][c]=="#":

                    a[r][c],a[r+1][c],a[r+1][c-1],a[r+1][c+1],a[r+2][c]=".",".",".",".","."

                else:print("NO");return
    print("YES")
solve()
#for _ in range(int(input())):solve()