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 '#'.
from math import gcd



def solve():
    n = int(input())
    res = 'YES'
    cnt = []
    for i in range(n):
        cnt.append(['.'])
        s = input()

        for c in s:
            cnt[i].append(c)

    for i in range(n):
        for j in range(n+1):
            if cnt[i][j]=='#':
                if i>=n-2 or j==n:
                    res = "NO"
                    continue
                if cnt[i+1][j]=='.' or cnt[i+1][j-1]=='.' or cnt[i+1][j+1]=='.':
                    res = "NO"
                    continue
                if cnt[i+2][j]=='.':
                    res='NO'
                cnt[i][j]='.'
                cnt[i+1][j]='.'
                cnt[i+2][j]='.'
                cnt[i+1][j-1]='.'
                cnt[i+1][j+1]='.'
    print(res)






solve()

