My solution to the puzzle posted here few days back is below.

Implement a function h(n) as below:

h(h(n)) = -n

 static int run = 0  
 int f(n)  
 {  
 run++;  
 return (pow(-1,(run-1))*n);  

 }