CF1567C.Carrying Conundrum

Alice has just learned addition. However, she hasn't learned the concept of "carrying" fully — instead of carrying to the next column, she carries to the column two columns to the left.

For example, the regular way to evaluate the sum $2039 + 2976$ would be as shown:

However, Alice evaluates it as shown:

In particular, this is what she does:

• add $9$ and $6$ to make $15$, and carry the $1$ to the column two columns to the left, i. e. to the column "$0$ $9$";
• add $3$ and $7$ to make $10$ and carry the $1$ to the column two columns to the left, i. e. to the column "$2$ $2$";
• add $1$, $0$, and $9$ to make $10$ and carry the $1$ to the column two columns to the left, i. e. to the column above the plus sign;
• add $1$, $2$ and $2$ to make $5$;
• add $1$ to make $1$.

Thus, she ends up with the incorrect result of $15005$.

Alice comes up to Bob and says that she has added two numbers to get a result of $n$. However, Bob knows that Alice adds in her own way. Help Bob find the number of ordered pairs of positive integers such that when Alice adds them, she will get a result of $n$. Note that pairs $(a, b)$ and $(b, a)$ are considered different if $a \ne b$.

爱丽丝刚刚学会了加法。然而，她尚未完全掌握“进位”的概念——她不是将进位加到左边相邻的数位上，而是加到左边第二个数位上。

例如，按照常规方法计算 $2039 + 2976$ 的过程如下所示：

但爱丽丝的计算方式如下所示：

具体而言，她的操作如下：

• 将 $9$ 和 $6$ 相加得 $15$，并将进位 $1$ 加到左边第二个数位上，即加到 "$0$ $9$" 所在的数位；
• 将 $3$ 和 $7$ 相加得 $10$，并将进位 $1$ 加到左边第二个数位上，即加到 "$2$ $2$" 所在的数位；
• 将进位 $1$、$0$ 和 $9$ 相加得 $10$，并将进位 $1$ 加到左边第二个数位上，即加到加号上方的数位；
• 将进位 $1$、$2$ 和 $2$ 相加得 $5$；
• 最后单独写下进位 $1$。

因此，她得到了错误的结果 $15005$。

爱丽丝找到鲍勃，声称自己将两个数相加得到了结果 $n$。但鲍勃知道爱丽丝使用的是她自己的加法方式。请帮助鲍勃找出有多少个有序正整数对 $(a, b)$，使得当爱丽丝用她的方式将 $a$ 和 $b$ 相加时，结果恰好为 $n$。注意：若 $a \ne b$，则 $(a, b)$ 和 $(b, a)$ 被视为不同的数对。

The input consists of multiple test cases. The first line contains an integer $t$ ($1 \leq t \leq 1000$) — the number of test cases. The description of the test cases follows.

The only line of each test case contains an integer $n$ ($2 \leq n \leq 10^9$) — the number Alice shows Bob.

输入包含多个测试用例。第一行包含一个整数 $t$（$1 \leq t \leq 1000$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例仅有一行，包含一个整数 $n$（$2 \leq n \leq 10^9$），即爱丽丝展示给鲍勃的数字。

For each test case, output one integer — the number of ordered pairs of positive integers such that when Alice adds them, she will get a result of $n$.

对于每个测试用例，输出一个整数——满足条件的正整数有序对的数量，使得爱丽丝将它们相加后得到结果 $n$。

In the first test case, when Alice evaluates any of the sums $1 + 9$, $2 + 8$, $3 + 7$, $4 + 6$, $5 + 5$, $6 + 4$, $7 + 3$, $8 + 2$, or $9 + 1$, she will get a result of $100$. The picture below shows how Alice evaluates $6 + 4$:

在第一个测试用例中，当爱丽丝计算任意一个和式 $1 + 9$、$2 + 8$、$3 + 7$、$4 + 6$、$5 + 5$、$6 + 4$、$7 + 3$、$8 + 2$ 或 $9 + 1$ 时，她都会得到结果 $100$。下图展示了爱丽丝如何计算 $6 + 4$：