At a certain pizzeria, there are five different toppings available, and a pizza can be ordered with any (possibly empty) subset of them on it. Determine the number of ways to order an unordered pair of pizzas such that at most one topping appears on both pizzas and at least one topping appears on neither.

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