Given a number (N) of 32 bit size you are required to print the number you get by inverting bits in its binary representation (i.e. 1 is made 0 and 0 is made 1). In other words we are required to negate(~) the number.

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains an integer N.

**Output:**

For each test case in a new line print the required output.

**Constraints:**

1<=T<=100

1<=N<=10^8+9

**Example:
Input:**

2

4289384

1

4290677911

4294967294

takian ramaku | 68 |

STF | 64 |

basant-kumar | 48 |

backtracker1610 | 48 |

L.Lawliet | 47 |

N NAGA SAI KRISHNA | 761 |

whomi | 672 |

Anshu Ahirwar | 636 |

gau7av | 505 |

gameghost07 | 489 |

akhayrutdinov | 3486 |

sanjay05 | 3327 |

Jasleen Kaur 2 | 2012 |

Michael Riegger | 1821 |

Quandray | 1821 |