
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
A tournament in Anchurian checkers is conducted over multiple rounds. If the number of participants in a round is even, they are split into random pairs. If the number is odd, random pairs are created, and one player is randomly left out and does not participate in the round. No ties are possible, and the loser of each pair is eliminated from the tournament, while the winners and the player without a pair, if any, move to the next round under the same rules. This continues until only two players remain, who then play a final match to determine the tournament winner.

The tournament started with 26 participants, all of whom play equally well, meaning each player has an equal chance of winning against any opponent. Among these participants are Denis and Oleg. Find the probability that Denis and Oleg will play against each other at some point during the tournament.

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