Alternating Bits Count

You are given a non-negative integer 'n'. Your task is to count the number of bits that are set in 'n' such that no two adjacent bits are both set (1). It is a valid configuration if the binary representation does not have '11' adjacent. Input format: A single integer n (0 <= n <= 10^9). Output format: A single integer, the count of valid set bits. Example: If the input is '13', the binary representation is '1101', which has 2 valid set bits. So, the output should be '2'.