Special Small Fountain

This problem is the same as the "Special Big Fountain" problem, except for the limits on $x\_0$ and $N$.

NLCS has many fountains.

The water height in a fountain changes by a fixed rule. If the height of the fountain at integer time $t$ is the integer $x\_t$, then $x\_{t+1}$ is $\lfloor \frac{x\_t}{2} \rfloor \oplus 6$ when $x\_t$ is even, and $(2 \cdot x\_t) \oplus 6$ when $x\_t$ is odd.

Given the height of the fountain at time 0, write a program that finds the height of the fountain at time $N$.

The first line contains $x\_0$ and $N$, the height of the fountain at time 0 and the time $N$. Both $x\_0$ and $N$ are integers.

Print the height of the fountain at time $N$ on the first line.

• $0 \le x\_0, N \le 1\,000$

• $\lfloor x \rfloor$ is the largest integer less than or equal to $x$.
• $\oplus$ is the bitwise XOR operator. See the Wikipedia article on bitwise operations for details. Most programming languages implement bitwise XOR as ^.