跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1001. Chloe and the sequence

  • ID: 1007
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:基础
  • 上传者:
  • 二分
  • 位运算
  • 构造
  • 模拟
  • 算法思想
  • 数学
  • 编程与模拟
  • 基础
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

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.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 449 题。保留原作者与原赛事署名。