Designing function f(f(n)) == -n

Question

A question I got on my last interview:

Design a function f, such that:

f(f(n)) == -n

Where n<

Answer 1

I could imagine using the 31st bit as an imaginary (i) bit would be an approach that would support half the total range.