# Population Count
## Problem Statement
You are given a list of integers. For each integer, your task is to determine and output the count of 'set' bits (bits with a value of 1) in its binary representation. For non-negative integers, this refers to their standard binary form. For negative integers, the count should be based on their two's complement representation, assuming a standard 32-bit signed integer format.
## Input Format
- The first line contains a single integer n (1 ≤ n ≤ 10⁵), representing the number of integers that follow.
- The second line contains n integers a₁, a₂, ..., aₙ (-10⁹ ≤ aᵢ ≤ 10⁹), for which you need to count the set bits.
## Output Format
For each integer aᵢ from the input, output the count of its set bits on a new line. The order of output should correspond to the order of input integers.
## Sample Test Cases
### Sample Input 1
```
3
5 0 -1
```
### Sample Output 1
```
2
0
32
```
### Sample Input 2
```
2
7 -5
```
### Sample Output 2
```
3
30
```
## Constraints
- 1 ≤ n ≤ 10⁵
- -10⁹ ≤ aᵢ ≤ 10⁹
- Time limit: 1 second
- Memory limit: 256 MB
## Explanation
**Sample Input 1:**
- For a₁ = 5: In 32-bit binary, 5 is `...00000101`. It has 2 set bits.
- For a₂ = 0: In 32-bit binary, 0 is `...00000000`. It has 0 set bits.
- For a₃ = -1: In 32-bit two's complement, -1 is `111...111` (all 32 bits are 1). It has 32 set bits.
**Sample Input 2:**
- For a₁ = 7: In 32-bit binary, 7 is `...00000111`. It has 3 set bits.
- For a₂ = -5: In 32-bit two's complement:
- Positive 5 is `...00000101`.
- Bitwise NOT of 5 is `...11111010`.
- Adding 1 gives `...11111011`.
- This representation has 30 set bits (32 total bits - 2 zero bits at positions 0 and 2 from the right, if 0-indexed).
Loading problem statement...