Along a stretch of coastline, n harbor beacon towers stand in a row. Each tower continuously broadcasts a signal code — a non-negative integer whose bits mark which light channels the tower currently has switched on. Between every two neighboring towers sits a relay pole, and every relay pole must light any channel that either of its two neighboring towers has lit, so its code is the bitwise OR of the two towers' codes. Given the beacon codes in order along the coast, report the code broadcast by every relay pole, from the one between the first and second tower through the one between the second-to-last and last tower.

Input format

• Line 1: a single integer n — the number of beacon towers.
• Line 2: n space-separated integers a1, a2, ..., an — the signal code of each tower, in order along the coast.

Output format

Print n-1 space-separated integers on a single line: the relay code between tower i and tower i+1, for i = 1 to n-1, in that order.

Constraints

• 2 <= n <= 10^5
• 0 <= a_i <= 10^9

4
5 3 9 2

7 11 11

2
0 0

0