This problem is equivalent to counting the number of orthomorphisms or complete mappings of #92;Zeta#47;n}, to counting the number of arrangements of n mutually nonattacking semiqueens on an n#92;timesn toroidal chessboard, and to counting the number of transversals in a cyclic Latin square.
Source: wiktionary