Given an n × n table T consisting of lowercase English letters. We'll consider some string s good if the table contains a correct path corresponding to the given string. In other words, good strings are all strings we can obtain by moving from the left upper cell of the table only to the right and down. Here's the formal definition of correct paths:

Consider rows of the table are numbered from 1 to n from top to bottom, and columns of the table are numbered from 1 to n from left to the right. Cell (r, c) is a cell of table T on the r-th row and in the c-th column. This cell corresponds to letter T_r, c.

A path of length k is a sequence of table cells [(r₁, c₁), (r₂, c₂), ..., (r_k, c_k)]. The following paths are correct:

1. There is only one correct path of length 1, that is, consisting of a single cell: [(1, 1)];
2. Let's assume that [(r₁, c₁), ..., (r_m, c_m)] is a correct path of length m, then paths [(r₁, c₁), ..., (r_m, c_m), (r_m + 1, c_m)] and [(r₁, c₁), ..., (r_m, c_m), (r_m, c_m + 1)] are correct paths of length m + 1.

We should assume that a path [(r₁, c₁), (r₂, c₂), ..., (r_k, c_k)] corresponds to a string of length k: T_r1, c1 + T_r2, c2 + ... + T_rk, ck.

Two players play the following game: initially they have an empty string. Then the players take turns to add a letter to the end of the string. After each move (adding a new letter) the resulting string must be good. The game ends after 2n - 1 turns. A player wins by the following scenario:

1. If the resulting string has strictly more letters "a" than letters "b", then the first player wins;
2. If the resulting string has strictly more letters "b" than letters "a", then the second player wins;
3. If the resulting string has the same number of letters "a" and "b", then the players end the game with a draw.

Your task is to determine the result of the game provided that both players played optimally well.