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 '#'.
n = int(input());

s = [['.'] * n] * n;

for i in range(0, n):
    s[i] = list(input());

flag = 1;

for i in range(0, n - 2):
    for j in range(1, n - 1):
        if (s[i][j] == '#'):
            flag &= s[i + 1][j] == '#';
            flag &= s[i + 1][j - 1] == '#';
            flag &= s[i + 1][j + 1] == '#';
            flag &= s[i + 2][j] == '#';
            flag &= s[i][j] == '#';
            s[i + 1][j] = '.';
            s[i + 1][j - 1] = '.';
            s[i + 1][j + 1] = '.';
            s[i + 2][j] = '.';
            s[i][j] = '.';

for i in range(0, n):
    for j in range(0, n):
        flag &= s[i][j] == '.';



if (flag == 1):
    print("YES");
else:
    print("NO");




