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_board(b):
    possible = 'YES'
    b_size = len(b)
    for i in range(board_size):
        for j in range(b_size):
            if b[i][j] == "#":
                if j == 0 or j == b_size - 1 or i > b_size - 3:
                    possible = 'NO'
                    return possible
                elif b[i+1][j-1] != "#" or b[i+1][j] != "#" or b[i+1][j+1] != "#" or b[i+2][j] != "#":
                    possible = 'NO'
                    return possible
                else:
                    b[i + 1][j - 1] = "used"
                    b[i + 1][j] = "used"
                    b[i + 1][j + 1] = "used"
                    b[i + 2][j] = "used"
    return possible


if __name__ == "__main__":
    board_size = int(input())
    board = []
    for n in range(board_size):
        line = list(input())
        board.append(line)
    print(check_board(board))