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 '#'.
import math
for m in range(1,2 ):
    n = int(input()) 
    arr = []
   # n, x= list(map(int, input().split()))
    for i in range(n):
        a = list(input()) 
        arr.append(a)
        
        
    left =0    
    for i in range(n-2):
        for j in range(1,n-1):
            #print(i, j)
            if arr[i][j] =="#" :
                hash1 = arr[i][j]
                hash2 = arr[i+1][j]
                hash3 = arr[i+1][j+1]
                hash4 = arr[i+1][j-1]
                hash5 = arr[i+2][j]
                if hash1==hash2==hash3==hash4==hash5=="#" :       
                    arr[i][j] = "x"
                    arr[i+1][j] = "x"
                    arr[i+1][j+1] = "x"
                    arr[i+1][j-1] = "x"
                    arr[i+2][j] = "x"
                else:
                    left +=1
            else:
                continue 
    if left==0:
        print("YES")
    else:
        print("NO")