Election Winner Determination

In an ongoing election between two candidates A and B, there is a queue of voters that includes supporters of A, supporters of B, and neutral voters. Neutral voters have the power to swing the election results based on which candidate influences them to their side.

Voting Influence Mechanics:

1. The queue is represented by the characters { '-', 'A', 'B' }, where '-' is a neutral voter, 'A' is a supporter of A, and 'B' is a supporter of B.
2. Supporters of A can only move left, influencing neutral voters.
3. Supporters of B can only move right, influencing neutral voters.
4. Movement happens simultaneously for both supporters of A and B.
5. If a supporter of A reaches a neutral voter before a supporter of B, that voter supports A.
6. Conversely, if a supporter of B reaches a neutral voter first, that voter supports B.
7. If both reach a neutral voter at the same time, the voter remains neutral.
8. Determine the election winner: A wins if they have more supporters, B wins if they have more supporters, or it's a Coalition if it's a tie.

Example:

Input:

String: "B--A-"

Output:

B

Explanation:

In the given string, B can influence more neutral voters compared to A. Thus, B has a total of 3 supporters, outnumbering A's 2 supporters.

Input:

The first line contains an integer T, the number of test cases.
Each of the next T lines contains a string of characters 'A', 'B', and '-'.

Output:

For each test case, print 'A' if A wins, 'B' if B wins, or 'Coalition' if it's a tie, each on a new line.

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 10⁴
• No test case with all votes neutral.

Additional Notes:

You are required to implement the function; printing is handled elsewhere.