n = int(input())
a = [list(input()) for i in range(n)]
v = [[0]*n for i in range(n)]
s = "yizhong"

def dfs(x,y,dx,dy,t,nodes):
    if t>7:
        for node in nodes:
            v[node[0]][node[1]] = 1
        return
    if a[x][y] == s[t-1]:
        nodes.append([x,y])
        dfs(x+dx,y+dy,dx,dy,t+1,nodes)
for i in range(n):
    for j in range(n):
        if a[i][j] == 'y':
            for dx,dy in [[1,0],[-1,0],[1,-1],[0,-1],[-1,-1],[1,1],[0,1],[-1,1]]:
                if i+dx>=0 and i+dx<n and j+dy>=0 and j+dy<n:
                    dfs(i+dx,j+dy,dx,dy,2,[[i,j]])

for i in range(n):
    for j in range(n):
        if v[i][j] != 1:
            a[i][j] = '*'
for i in range(n):
    for j in range(n):
        print(a[i][j],end='')
    print()