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 checar(i, j,qtd):
  if (i>0):
    if(matriz[i-1][j]):
      return 1
  elif (j>0):
    if(matriz[j-1][j]):
      return 1
  elif (i<qtd-1):
    if(matriz[i+1][j]):
      return 1
  elif (j<qtd-1):
    if(matriz[i][j+1]):
      return 1
  return 0

def procura(matriz, qtd):
  velha = 0
  for i in range(qtd):
    for j in range(qtd):
      if (matriz[i][j] == '#'):
        velha+=1
        retorno = checar(i, j, qtd)
        if (not(retorno)):
          return -1
  return velha
qtd = int(input())
matriz = []*qtd
for i in range(qtd):
  lista = list(input())
  matriz.append(lista)
velha = procura(matriz, qtd)
if (velha %5==0 and velha != -1):
  print("YES")
else:
  print("NO")
			    		 	  		   		 						 	