def backtrack(row, col, index, board, word):
    if index == len(word):
        return True

    if (row < 0 or row >= len(board) or     
        col < 0 or col >= len(board[0]) or   
        board[row][col] != word[index]):
        return False

    temp = board[row][col]
    board[row][col] = '#'

    found = (backtrack(row + 1, col, index + 1, board, word) or
             backtrack(row - 1, col, index + 1, board, word) or
             backtrack(row, col + 1, index + 1, board, word) or
             backtrack(row, col - 1, index + 1, board, word))

    board[row][col] = temp

    return found

def solve():
    line = input().strip()
    if not line:
        return
    n = int(line)

    board = []
    for _ in range(n):
        row = input().strip().split()
        board.append(row)

    word = input().strip()

    if not board or not word:
        return

    rows = len(board)
    cols = len(board[0])
    word_found = False

    for r in range(rows):
        for c in range(cols):
            if board[r][c] == word[0]:
                if backtrack(r, c, 0, board, word):
                    word_found = True
                    break
        if word_found:
            break

    if word_found:
        print("Word Found")
    else:
        print("Word Not Found")

if __name__ == "__main__":
    solve()

# Input (stdin):
# 3
# A B C E
# S F C S
# A D E E
# ABCCED

# Output (stdout):
# Word Found