codeforces 743 B. Chloe and the sequence (规律题)

B. Chloe and the sequence

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ≤ 2n - 1).

Output

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

Examples

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.

题意：一个数列开始有一个元素1 ，然后每到i就在数列依次增加i 和增加前的原数列

例如：

n=1: 1

n=2: 1 2 1

n=3: 1 2 1 3 1 2 1

n=4: 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1

……

可以看出数列有对称性

思路：利用对称性，如果k>a[n-1] ( 2 的n-1次方)，就把k对折到n的左边,n--;

k<a[n-1],就n--.

code :

#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;
}