Give a Boolean formula that takes in a single integer between $0$ and $15$ in the form of $4$ inputs bits $($labelled W$,$ X$,$ Y$,$ Z from highest$-$order to lowest$-$order bit$)$ and outputs $1$ if the integer is either a power of $2$ or the square of some integer. and outputs $0$ otherwise.

Simplify this formula using Karnaugh maps.