Given an integer n, return the total number of pairs of positive integers (a, b) such that a + b = n, where neither a nor b contains the digit $0$ in its decimal representation.

Constraints:

• $2 \leq$ n $\leq 10^{15}$

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.