IrMO 1992 Problem 3

Let $A$ be a nonempty set with $n$ elements. Find the number of ways of choosing a pair of subsets $(B,C)$ of $A$ such that $B$ is a nonempty subset of $C$ .