Fibonacci Nim

A pile has 50 stones. On the FIRST move a player may remove any number of stones from 1 to 49 (not the whole pile). After that, a player may remove any number of stones up to TWICE the number the opponent just removed. The player taking the last stone wins. Does the first player win, and if so how many stones should they remove on the first move?