Alice and bob are playing a new game of stones. There are nn stones placed on the ground, forming a sequence. The stones are labeled from 11 to nn. Alice and bob in turns take exactly two consecutive stones on the ground until there are no consecutive stones on the ground. That is, each player can take stone ii and stone i 1i 1, where 1 \leq i \leq n - 11≤i≤n−1. If the number of stone left is odd, alice wins. Otherwise, bob wins. Assume both alice and bob play optimally and alice plays first, do you know who the winner is?