Finding B-th bit

[Shifter12345]

I have a task to solve:
I must enter a positive integer N and 0 < B < 31 and print the B-th bit of number N (potential of digit 2^B in binary number N).

#include <iostream>
using namespace std;
int main(){
    int N, B;
    cout << "Insert N = ";
    cin >> N;
    
    do{
        cout << "Insert B = ";
        cin >> B;
    }
    while(B < 1 || B > 31);

And here I stoped. I have no idea what to do next.
Any ideas?

[vlad from moscow]

The result is

N >> B & 1

Only B shall be in the range 0 <= B <= 31.

Otherwise the above expression will look like

N >> B - 1 & 1