Lonely Ones

Binary ones $(1)$ can get lonely if only zeros $(0)$

surround them. Formally, we call such $1\text{'}$s "sparse". A

number is defined as sparse if its binary

representation has no two consecutive bits set.

You are given an integer $N$ and your task is to find

out if it is sparse or not.

Input

The input contains an integer $N.$

Output

'Print $\text{'}1\text{'}$ if the number is sparse and $\text{'}0\text{'}$ if the number

is not sparse.

Constraints

$1N{10}^{18}$

Example #$1$

Explanation: The binary representation of $3615$

$100100.$ There are no consecutive ones present in

this. So it is a sparse number.