In some other world, today is Christmas.

Mr. Takaha decides to make a multi-dimensional burger in his party. A level-L burger (L is an integer greater than or equal to 0) is the following thing:

* A level-0 burger is a patty.
* A level-L burger (L \geq 1) is a bun, a level-(L-1) burger, a patty, another level-(L-1) burger and another bun, stacked vertically in this order from the bottom.



For example, a level-1 burger and a level-2 burger look like `BPPPB` and `BBPPPBPBPPPBB` (rotated 90 degrees), where `B` and `P` stands for a bun and a patty.

The burger Mr. Takaha will make is a level-N burger. Lunlun the Dachshund will eat X layers from the bottom of this burger (a layer is a patty or a bun). How many patties will she eat?

Constraints

* 1 \leq N \leq 50
* 1 \leq X \leq ( the total number of layers in a level-N burger )
* N and X are integers.

Input

Input is given from Standard Input in the following format:


N X


Output

Print the number of patties in the bottom-most X layers from the bottom of a level-N burger.

Examples

Input

2 7


Output

4


Input

1 1


Output

0


Input

50 4321098765432109


Output

2160549382716056

import java.io.IOException;
import java.io.InputStream;
import java.util.*;
import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.IntStream;


public class Main {
    static long[] len = new long[51];
    static long[] full = new long[51];

    public static void main(String[] args) {
        Scanner scanner = new Scanner();
        len[0] = 1;
        full[0] = 1;
        for (int i = 1; i < len.length; i++) {
            len[i] = len[i - 1] * 2 + 3;
            full[i] = full[i - 1] * 2 + 1;
        }
        int n = scanner.nextInt();
        long x = scanner.nextLong();
        put(func(n, x));
    }

    public static long func(int n, long x) {
        if (x <= 0) throw new IllegalArgumentException();
        if (n == 0) return 1;
        if (x == 1) return 0;
        if(x==len[n]) return 1+2*full[n-1];
        if (x <= len[n - 1] + 1) {
            return func(n - 1, x - 1);
        } else if (x > len[n - 1] + 2) {
            return full[n - 1] + func(n - 1, x - (2 + len[n - 1])) + 1;
        } else {
            return full[n - 1] + 1;
        }

    }


    public static int upper_bound(int[] a, int val) {
        return upper_bound(a, 0, a.length, val);
    }

    public static int upper_bound(int[] a, int l, int r, int val) {
        if (r - l == 1) {
            if (a[l] > val) return l;
            return r;
        }
        int mid = (l + r) / 2;
        if (a[mid] > val) {
            return upper_bound(a, l, mid, val);
        } else {
            return upper_bound(a, mid, r, val);
        }
    }

    public static int lower_bound(int[] a, int val) {
        return lower_bound(a, 0, a.length, val);
    }

    public static int lower_bound(int[] a, int l, int r, int val) {
        if (r - l == 1) {
            if (a[l] < val) return r;
            return l;
        }
        int mid = (l + r) / 2;
        if (a[mid] < val) {
            return lower_bound(a, mid, r, val);
        } else {
            return lower_bound(a, l, mid, val);
        }

    }


    public static int max(int a, int b) {
        return Math.max(a, b);
    }

    public static long max(long a, long b) {
        return Math.max(a, b);
    }

    public static int min(int a, int b) {
        return Math.min(a, b);
    }

    public static long min(long a, long b) {
        return Math.min(a, b);
    }

    public static int abs(int a) {
        return Math.abs(a);
    }

    public static long abs(long a) {
        return Math.abs(a);
    }

    public static void print(Object object) {
        System.out.print(object);
    }

    public static void put(Object object) {
        System.out.println(object);
    }

    public static void put() {
        System.out.println();
    }

    public static String format(String string, Object... args) {
        return String.format(string, args);
    }
}

final class Scanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}

final class FixedPair {
    final private int x, y;
    final static public FixedPair ZEROS = new FixedPair(0, 0);

    FixedPair(int x, int y) {
        this.x = x;
        this.y = y;
    }

    public int getX() {
        return x;
    }

    public int getY() {
        return y;
    }

    @Override
    public int hashCode() {
        return x + y;
    }

    @Override
    public boolean equals(Object obj) {
        boolean result = super.equals(obj);
        if (obj.getClass() != this.getClass()) {
            return false;
        }
        FixedPair pair = (FixedPair) obj;
        if (this.x == pair.x && this.y == pair.y) return true;
        return false;
    }

    @Override
    public String toString() {
        return String.format("(%d,%d)", x, y);
    }
}

final class Tuple<T, V> {
    //immutabl1でないことに注意(T,Vがmutableの場合変更可能)
    final private T t;
    final private V v;

    Tuple(T t, V v) {
        this.t = t;
        this.v = v;
    }

    public T getT() {
        return t;
    }

    public V getV() {
        return v;
    }

    @Override
    public int hashCode() {
        return (t.hashCode() + v.hashCode());
    }

    @Override
    @SuppressWarnings("unchecked")
    public boolean equals(Object obj) {
        if (obj.getClass() != this.getClass()) {
            return false;
        }
        Tuple<T, V> tuple = (Tuple<T, V>) obj;
        return tuple.t.equals(this.t) && tuple.v.equals(this.v);
    }

    @Override
    public String toString() {
        return String.format("<Tuple>=<%s,%s>", t, v);
    }
}

final class LowerBoundComparator<T extends Comparable<? super T>>
        implements Comparator<T> {
    public int compare(T x, T y) {
        return (x.compareTo(y) >= 0) ? 1 : -1;
    }
}

final class UpperBoundComparator<T extends Comparable<? super T>>
        implements Comparator<T> {
    public int compare(T x, T y) {
        return (x.compareTo(y) > 0) ? 1 : -1;
    }
}

final class Util {
    static long gcd(long a, long b) {
        //最大公約数　
        if (a % b == 0) return b;
        return gcd(b, a % b);
    }

    static long lcm(long a, long b) {
        //最小公倍数
        long gcd = gcd(a, b);
        long result = b / gcd;
        return a * result;
    }

    static long kaijoMod(int n, int mod) {
        if (n < 1) return -1;
        long result = 1;
        for (int i = n; i > 1; i--) {
            result *= i;
            result %= mod;
        }
        return result;
    }

    static <T extends Comparable<T>> Map<T, Integer> count(List<T> list) {
        //副作用
        Collections.sort(list);
        Map<T, Integer> result = new HashMap<>();
        int l = 0, r = 0;
        while (l < list.size()) {
            while (r < list.size() - 1 && list.get(r).equals(r + 1)) {
                r++;
            }
            result.put(list.get(r), r - l + 1);
            r++;
            l = r;
        }
        return result;

    }

    static Map<Integer, Integer> count(int[] array) {
        //副作用
        Arrays.sort(array);
        Map<Integer, Integer> result = new HashMap<>();
        int l = 0, r = 0;
        while (l < array.length) {
            while (r < array.length - 1 && array[r] == array[r + 1]) {
                r++;
            }
            result.put(array[l], r - l + 1);
            r++;
            l = r;
        }
        return result;
    }

    static <T> String toStringBWS(Iterable<T> iterable) {
        Iterator<T> ite = iterable.iterator();
        return toStringBWS(ite);
    }

    static <T> String toStringBWS(Iterator<T> ite) {
        StringBuilder sb = new StringBuilder();
        sb.append(ite.next());
        while (ite.hasNext()) {
            sb.append(" ");
            sb.append(ite.next());
        }
        return sb.toString();
    }

    static int[] factoringInPrimeNumbers(long n, int size) {
        //素因数分解
        //sizeがnに比べて小さい場合完全に素因数分解出来ていない可能性がある
        int[] result = new int[size];
        for (int i = 2; n > 1 && i < result.length; i++) {
            while (n % i == 0) {
                result[i]++;
                n /= i;
            }
        }
        return result;

    }
}
