Counting Boolean functions

Inputs. $2^n$ inputs.

Outputs. Each input has $2$ choices, so $2^{2^n}$ functions total.

Conclusion. There are $2^{2^n}$ Boolean functions of $n$ variables.

Example. For $n=2$, $2^4=16$ Boolean functions.