HMMT 2012 U27

Let $S$ be the set $\{1,2, \ldots, 2012\}$. A perfectutation is a bijective function $h$ from $S$ to itself such that there exists an $a \in S$ such that $h(a) \neq a$, and that for any pair of integers $a \in S$ and $b \in S$ such that $h(a) \neq a, h(b) \neq b$, there exists a positive integer $k$ such that $h^{k}(a)=b$. Let $n$ be the number of ordered pairs of perfectutations $(f, g)$ such that $f(g(i))=g(f(i))$ for all $i \in S$, but $f \neq g$. Find the remainder when $n$ is divided by 2011 .