What is the number of ordered pairs $(A,B)$ where $A$ and $B$ are subsets of $\{1,2,..., 5\}$ such that neither $A \subseteq B$ nor $B \subseteq A$?

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