Eulerian and Hamiltonian Graphs · Medium problem

Take $K_{4,4}$ (sides $\{l_1,\ldots,l_4\}$ and $\{r_1,\ldots,r_4\}$) and remove the perfect matching $l_1r_1, l_2r_2, l_3r_3, l_4r_4$, leaving $12$ edges and every vertex at degree $3$. For a same-side (non-adjacent) pair such as $l_1, l_2$, by how much does $\deg(l_1)+\deg(l_2)$ fall short of $n=8$?