N^{2} numbers are arranged in a square pattern. Select one of the numbers and try answering computer queries. After two attempts, computer will reveal your selected number.

Simple as the trick is, it was described by [Rouse Ball, p. 325] and referred to by [M. Gardner, p. 3]. Martin Gardner writes: "The success of the trick depends, of course, on the spectator's inability to follow the procedure well enough to guess the operating principle." He then selfishly adds: "Unfortunately, few spectators are that dense."

Every location in the square is determined by its row and column numbers. The column is indicated directly on the first response, after which the columns of the square are swapped with the corresponding rows. Answer to the second query therefore determines the row. To confound the mildly dense spectators, computer, before displaying the numbers, randomly reshuffles them in every column.