Solution

For a Boolean function of $n$ variables, the number of possible input combinations is

$2^n$

For each input combination, the output can be either $0$ or $1$.

So, total number of Boolean functions is

$2^{2^n}$