Two Megaminds play a game on an infinite rectangular grid. In each round, the first player traces out a 2x2 or a 3x3 square, and the second player shades one of the 1x1 cells inside of this square. Players cannot repeat their moves, i.e. no square can be traced twice and no cell can be shaded twice. The second player wins if he can make at least 15 moves, otherwise the first player wins. Who is guaranteed to win in this games?