Given a positive integer **N**, print count of set bits in it. For example, if the given number is 6, output should be 2 as there are two set bits in it.

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The next T lines will contain an integer **N**.

**Output:**

Corresponding to each test case, in a new line, print count of set bits in it.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 1000000

**Example:**

**Input:**

2

6

11

**Output:**

2

3

mhao | 100 |

Ravneet Baansal | 100 |

bentlynixon | 91 |

Chiluka Ashish | 80 |

Dipti Yadav | 80 |

tyaglot | 447 |

bentlynixon | 304 |

taobupt | 274 |

thurki | 261 |

Ravneet Baansal | 253 |

akhayrutdinov | 3956 |

sanjay05 | 3366 |

Michael Riegger | 2129 |

Quandray | 2095 |

Jasleen Kaur 2 | 2012 |