Given a string s, count the number of asterisks '*' that do not appear between any pair of vertical bars '|'.

The vertical bars '|' are paired consecutively from left to right. That is, the characters between the $1^{ ext{st}}$ and $2^{ ext{nd}}$ bar, between the $3^{ ext{rd}}$ and $4^{ ext{th}}$ bar, and so on, are excluded from the count.

Return the total number of valid asterisks.

Constraints:

• $1 \leq$ s.length $\leq 1000$

• s consists of lowercase English letters, vertical bars '|', and asterisks '*'.

• s contains an even number of vertical bars '|'.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.