Fox Ciel is playing a game with numbers now. 

Ciel has *n* positive integers: *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub>. She can do the following operation as many times as needed: select two different indexes *i* and *j* such that *x*<sub class="lower-index">*i*</sub> &gt; *x*<sub class="lower-index">*j*</sub> hold, and then apply assignment *x*<sub class="lower-index">*i*</sub> = *x*<sub class="lower-index">*i*</sub> - *x*<sub class="lower-index">*j*</sub>. The goal is to make the sum of all numbers as small as possible.

Please help Ciel to find this minimal sum.
The first line contains an integer *n* (2 ≤ *n* ≤ 100). Then the second line contains *n* integers: *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub> (1 ≤ *x*<sub class="lower-index">*i*</sub> ≤ 100).
size = int(input())
field = [list(input()) for i in range(size)]
ans = "YES"
for i in range(size):
    for j in range(size):
        if field[i][j] == '.':
            continue
        if i < size - 2 and j > 0 and j < size - 1 and field[i + 1][j] == '#' and field[i + 1][j - 1] == '#' and field[i + 1][j + 1] == '#' and field[i + 2][j] == '#':
                field[i][j] = '.'
                field[i + 1][j] = '.'
                field[i + 1][j - 1] = '.'
                field[i + 1][j + 1] = '.'
                field[i + 2][j] = '.'
        else:
            ans = "NO"
print(ans)