CF743B.Chloe and the sequence

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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!

输入格式

The only line contains two integers $n$ and $k$ ( $1<=n<=50$ , $1<=k<=2^{n}-1$ ).

输出格式

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

输入输出样例

输入#1
```
3 2
```
输出#1
```
2
```
输入#2
```
4 8
```
输出#2
```
4
```

说明/提示

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$ .

首页