Chip and Dale play the following game. Chip starts by splitting $222$ nuts between two piles, so Dale can see it. In response, Dale chooses some number $N$ from $1$ to $222$. Then Chip moves nuts from the piles he prepared to a new (third) pile until there will be exactly $N$ nuts in any one or two piles. When Chip accomplishes his task, Dale gets an exact amount of nuts that Chip moved. What is the maximal number of nuts that Dale can get for sure, no matter how Chip acts? (Naturally, Dale wants to get as many nuts as possible, while Chip wants to lose as little as possible).

Let's think step by step and output the final answer within \boxed{}.
user