Count Set Bits in an Integer

Solving Approach

How do you plan to solve it?

Code

#include <stdio.h>

int countSetBits(unsigned int n) 
{
    unsigned int output=0;
    while(n)
    {
        if (n&(1<<0))
        {
            output++;
        }
        n = (n>>1);
    }
    return output;
}

int main() {
    int n;
    scanf("%d", &n);
    printf("%d", countSetBits(n));
    return 0;
}