
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system
On the Saturday of a weekend soccer tournament, Team E plays Team F and Team G plays Team H. However, unlike a traditional setup, each match can end in a draw, which necessitates a tie-breaking game to decide the winner. On Sunday, the two Saturday winners (or tie-breaker victors) play for first and second places while the two Saturday losers (or tie-breaker losers) play for third and fourth places. There are no ties on Sunday. One possible ranking of the team from first place to fourth place at the end of the tournament with no tie-breakers needed is the sequence EGHF. What is the total number of possible four-team ranking sequences at the end of the tournament, considering potential draws and tie-breakers?

Present the answer in LaTex format: \boxed{Your answer}
user