Two Nikifors play a funny game. There is a heap of *N* stones in front of them. Both Nikifors in turns take some stones from the heap. One may take any number of stones with the only condition that this number is a nonnegative integer power of 2 (e.g. 1, 2, 4, 8 etc.). Nikifor who takes the last stone wins.
You are to write a program that determines winner assuming each Nikifor does its best.

### Input

An input contains the only positive integer number *N* (condition *N* ≤ 10^{250} holds).

### Output

The first line should contain 1 in the case the first Nikifor wins and 2 in case the second one does. If the first Nikifor wins the second line should contain the minimal number of stones he should take at the first move in order to guarantee his victory.

### Sample

**Problem Author: **Dmitry Filimonenkov

**Problem Source: **Third USU personal programming contest, Ekaterinburg, Russia, February 16, 2002