
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 deck of cards contains 52 cards, where each of the suits "diamonds", "clubs", "hearts", and "spades" has 13 cards, marked $2,3, \cdots, 10, J, Q, K, A$. Any two cards of the same suit and adjacent ranks are called "straight flush cards," and $A$ with 2 is also considered a consecutive pair (i.e., $A$ can be used as 1). Determine the number of ways to draw 13 cards from this deck so that each rank appears exactly once and no "straight flush cards" are included.

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