Chloe and the sequence CodeForces - 743B

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!

Input

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

Output

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

Example

Input

3 2

Output

2

Input

4 8

Output

4

Note

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.

题意：给定一个数n，m，n表示的是列出的数组中最中间的那个数（看规律吧，n我也解释不清），m是查找的位置，求出m位置上的数

分析：此题解决方法很多，有的找规律，我的这种是二分查找然后不断的缩小。

#include <iostream>  
#include<cstdio>  
#include<cstring>  
#include<cmath>  
#include<algorithm>  
using namespace std;  
  
int main()  
{  
    __int64 n,k,a[55];  
    scanf("%I64d%I64d",&n,&k);  
    a[0]=1;  
    for(int i=1;i<51;i++)  
        a[i]=a[i-1]*2;  
    while(k!=a[n-1])  
    {  
        if(k>a[n-1])  
        {  
            k=a[n]-k;  
            n--;  
        }  
        else  
            n--;  
    }  
    printf("%I64d\n",n);  
    return 0;  
}  

还有另一种方法：（大牛写的，不会，好像是求二进制中“1”的个数这么个函数）

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <queue>
#include <string.h>
using namespace std;
int main()
{
	long long  k,n;
	cin>>n>>k;
	cout<<__builtin_ffsll(k);
}