Given a number, change all bits at even positions to 0.

Example:

```
Input : 30
Output : 10
Binary representation of
```**1**1**1**1**0**.
Bits at Even positions are highlighted.
After making all of them 0, we get **0**1**0**1**0**

**Input:**

First line consists of T test cases. Only line, consists of a integer N.

**Output:**

Single line output, print the modified number.

**Constraints:**

1<=T<=100

1<=N<=(32-bit number)

**Example:
Input:**

2

30

10

10

10

All Is Well | 176 |

Srinivas Chakravarth | 142 |

ioan | 131 |

praveen2809 | 116 |

Diplav Srivastava | 105 |

Lam Ngoc Pham | 405 |

All Is Well | 365 |

Divvya Sinha | 356 |

skull tone | 310 |

Prateek Gole | 309 |

akhayrutdinov | 3805 |

sanjay05 | 3366 |

Michael Riegger | 2014 |

Jasleen Kaur 2 | 2012 |

Quandray | 1933 |