For Booleans A and B$,$ "A NOR B$"$ is defined to be "NOT $($A OR B$)".$

Help prove that NOR is universal $($like NAND$)$ by entering an expression using just parentheses, NOR operators and A that will be the same as NOT A$.$

For purposes of this question, $-$ will be used as the NOR operator, so A$-$B means A NOR B$.$ You can only use the characters $()-$A to answer this question.