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 check(a, b, n):
	return a>=0 and b>=0 and a<n and b<n

def solve():
	n = int(input())
	ar = []
	for i in range(n):
		ar.append(input())

	cross = [[0]*n for _ in range(n)]

	addc = [(1, 0), (2, 0), (1, -1), (1, 1)]

	for i in range(n):
		for j in range(n):
			if ar[i][j] == "#" and cross[i][j] == 0:
				cross[i][j] = 1
				for a, b in addc:
					if check(i+a, j+b, n):
						#print(ar[i+a][j+b], cross[i+a][j+b])
						if ar[i+a][j+b] == "#" and cross[i+a][j+b] == 0:
							cross[i+a][j+b] = 1
						else:
							print("NO")
							return
					else:
						print("NO")
						return
	print("YES")


solve()