9. In the known sequence $1,4,8,10,16,19,21,25,30,43$, the number of arrays where the sum of adjacent numbers is divisible by 11 is $\qquad$ .
Given the sequence $\left\{x_{n}\right\}$, the remainders when each term is divided by 11 are $1,4,-3,-1,5,-3,-1,3,-3,-1$.
Thus, starting from the first term, the remainders when the sum of any $k(k=1,2, \cdots, 10)$ consecutive terms is divided by 11 form the sequence $\left\{a_{n}\right\}$:
$1,5,2,1,6,3,2,5,2,1$. That is, $a_{k} \equiv x_{1}+x_{2}+\cdots+x_{k}(\bmod 11)$.
Then, the sums of adjacent several numbers that can be divided by 11 are $a_{10}-a_{4}, a_{10}-a_{1}, a_{4}-a_{1}, a_{9}-a_{7}$, $a_{9}-a_{3}, a_{7}-a_{3}, a_{8}-a_{2}$, a total of 7 groups.