Recently Alice and Bob are playing a game about strings. Before starting the game, they should prepare n strings s1, s2, ..., sn and a target string t. It's promised that each of these n strings is a substring of t. When the game begins, they do the following things alternately while Alice starts first: Choose a string si from the n strings; Append one letter to the chosen string; The new string must also be a substring of t. If the above things cannot be completed, the player loses the game. Suppose Alice and Bob both use optimal strategy, find who will win the game.
Recently Alice and Bob are playing a game about strings. Before starting the game, they should prepare n strings s1, s2, ..., sn and a target string t. It's promised that each of these n strings is a substring of t. When the game begins, they do the following things alternately while Alice starts first: Choose a string si from the n strings; Append one letter to the chosen string; The new string must also be a substring of t. If the above things cannot be completed, the player loses the game. Suppose Alice and Bob both use optimal strategy, find who will win the game.
（图片来源网络，侵删）
