One token is placed on each square of an infinite checkerboard. One square is marked with an X. You want to get as many tokens on the marked square as possible. To do this, you may make any finite number of moves, where a move consists of choosing a square, placing two tokens on that square, and removing any three tokens of your choice from the eight surrounding squares.

What is the maximum number of tokens that you can have on the X?