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 '#'.
def canDraw(n, matrix):
  can = True
  for i in range(n):
    for j in range(n):
      if matrix[i][j] == "#":
        if matrix[i+1][j] == "#" and matrix[i+2][j] == "#" and matrix[i+1][j-1] == "#" and matrix[i+1][j+1] == "#":
          matrix[i][j] = "."
          matrix[i+1][j] = "."
          matrix[i+2][j] = "."
          matrix[i+1][j-1] = "."
          matrix[i+1][j+1] = "."
        else:
          can = False
          break
    if not can:
      break
  return can
  


### MAIN
n = int(input())
matrix = []
hash = 0
for i in range(n):
  string = input()
  hash += string.count("#")
  matrix.append(list(string))
if hash % 5 != 0:
  print("NO")
else:
  if canDraw(n, matrix):
    print("YES")
  else:
    print("NO")
	 			 	   			 	 	 		  	  		   	