#![allow(non_snake_case, unused)]
use std::cmp::*;
use std::collections::*;
use std::f64::consts::*;

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}
pub trait BinarySearch<T> {
    fn lower_bound(&self, value: &T) -> usize;
    fn upper_bound(&self, value: &T) -> usize;
}

impl<T: Ord> BinarySearch<T> for [T] {
    fn lower_bound(&self, value: &T) -> usize {
        let mut l = 0;
        let mut r = self.len();

        while l != r {
            let m = (l + r) / 2;
            match self[m].cmp(value) {
                Ordering::Less => {
                    l = m + 1;
                }
                Ordering::Equal | Ordering::Greater => {
                    r = m;
                }
            }
        }
        r
    }

    fn upper_bound(&self, value: &T) -> usize {
        let mut l = 0;
        let mut r = self.len();

        while l != r {
            let m = (l + r) / 2;
            match self[m].cmp(value) {
                Ordering::Equal | Ordering::Less => {
                    l = m + 1;
                }
                Ordering::Greater => {
                    r = m;
                }
            }
        }
        l
    }
}

fn f(n: usize, x: i64, b: Vec<i64>, p: Vec<i64>) -> i64 {
    if n == 0 {
        if x <= 0 {
            0
        } else {
            1
        }
    } else {
        if x <= 1 + b[n - 1] {
            f(n - 1, x - 1, b, p)
        } else {
            p[n - 1] + 1 + f(n - 1, x - (2 + b[n - 1]), b, p)
        }
    }
}

fn main() {
    input! {
        n: usize, x: i64,
    }
    let mut p = vec![0i64; n];
    let mut b = vec![0i64; n];
    p[0] = 1;
    b[0] = 1;
    for i in 1..n {
        p[i] = p[i - 1] * 2 + 1;
        b[i] = b[i - 1] * 2 + 3;
    }

    let ans = f(n, x, b, p);

    println!("{}", ans);
}


Measured memory_bytes: 4352