Let $p$ be a prime number. Let $J$ be the set of all $2 \times 2$ matrices $\binom{a b}{c d}$ whose entries are chosen from $\{0,1,2, \cdots, p-1\}$ and satisfy the conditions $a+d \equiv 1(\bmod p), a d-b c \equiv 0(\bmod p)$. Determine how many members $J$ has. The original answer is in the format of $p^2 + p$. Let p=5，Determine how many members $J$ has.

Let's think step by step and output the final answer within \boxed{}.
user