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 cross(i, j, v, n):
	v[i*n+j] = '.'
	if v[(i+1)*n+j] == '#':
		v[(i+1)*n+j] = '.'
		if v[(i+2)*n+j] == '#':
			v[(i+2)*n+j] = '.'
			if v[(i+1)*n+j+1] == '#':
				v[(i+1)*n+j+1] = '.'
				if v[(i+1)*n+j-1] == '#':
					v[(i+1)*n+j-1] = '.'
					return True
				else:
					return False
			else:
				return False
		else:
			return False
	else:
		return False


n = int(input())
v = ['.'] * n * n
ans = True

for i in range(n):
	s = input()
	for j in range(n):
		v[i*n+j] = s[j]

for i in range(n):
	if ans:
		for j in range(n):
			if v[i*n+j] == '#':
				if j == 0 or j == (n - 1) or i > (n - 3):
					ans = False
					break
				else:
					ans = cross(i, j, v, n)
	else:
		break

if ans:
	print('YES')
else:
	print('NO')