I am doing some practice sentential derivation proofs for an upcoming test and have attempt the following proof many, many times without success.

~(A ≡ B) ├ (~A ≡ B)

The logic system I am using is the Sentential Logic system which has the following inference rules: Reiteration, Conjunction Introduction/Elimination, Conditional Introduction/Elimination, Negation Introduction/Elimination, Disjunction Introduction/Elimination, and Biconditional Introduction/Elimination.