CF743B.Chloe and the sequence

Chloe, the same as Vladik, is a competitive programmer. She didn't have any problems to get to the olympiad like Vladik, but she was confused by the task proposed on the olympiad.

Let's consider the following algorithm of generating a sequence of integers. Initially we have a sequence consisting of a single element equal to 1. Then we perform (n - 1) steps. On each step we take the sequence we've got on the previous step, append it to the end of itself and insert in the middle the minimum positive integer we haven't used before. For example, we get the sequence [1, 2, 1] after the first step, the sequence [1, 2, 1, 3, 1, 2, 1] after the second step.

The task is to find the value of the element with index k (the elements are numbered from 1) in the obtained sequence, i. e. after (n - 1) steps.

Please help Chloe to solve the problem!

克洛伊和弗拉迪克一样，也是一名竞赛程序员。她不像弗拉迪克那样在前往奥林匹克竞赛途中遇到任何问题，但她在竞赛中却被一道题目难住了。

我们来考虑如下生成整数序列的算法：初始时序列为仅含一个元素 $1$ 的序列；随后执行 $(n-1)$ 步操作。每一步中，我们将上一步得到的序列复制一份并追加到自身末尾，并在两个副本之间插入此前尚未使用过的最小正整数。例如，第一步后得到序列 $[1,\,2,\,1]$，第二步后得到序列 $[1,\,2,\,1,\,3,\,1,\,2,\,1]$。

本题要求：求经过 $(n-1)$ 步操作后所得序列中下标为 $k$ 的元素的值（元素编号从 $1$ 开始）。

请帮助克洛伊解决这个问题！

The only line contains two integers n and k (1 ≤ n ≤ 50, 1 ≤ k ≤ 2_n_ - 1).

唯一一行包含两个整数 $n$ 和 $k$（$1 \leq n \leq 50$，$1 \leq k \leq 2^n - 1$）。

Print single integer — the integer at the k-th position in the obtained sequence.

输出一个整数——所得序列中第 k 个位置上的整数。

In the first sample the obtained sequence is [1, 2, 1, 3, 1, 2, 1]. The number on the second position is 2.

In the second sample the obtained sequence is [1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1]. The number on the eighth position is 4.

在第一个样例中，得到的序列为 [1, 2, 1, 3, 1, 2, 1]。第二个位置上的数字是 2。

在第二个样例中，得到的序列为 [1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1]。第八个位置上的数字是 4。