E-Exclusive OR_2020牛客暑期多校训练营（第二场）

时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

Given ${n}$ integers $A_1, A_2, \cdots, A_n$ . For all ${i}$ in $\{1, 2, \cdots, n\}$ , you should determine the maximum value you can get if you repeatably choose exactly ${i}$ integers $a_1, a_2, \cdots a_i$ and calulate their XOR sum $a_1 \oplus a_2 \oplus \cdots \oplus a_i$ .
Please notice that you can choose one integer multiple times for one ${i}$ in this problem.

输入描述:

The first line contains one integer , denoting the number of given integers.
The second line contains  integers .

输出描述:

One line containing  integers, where -th integer denotes the maximum value you can get if you repeatably choose  integers and calulate their XOR sum.

示例1

输入

复制

4
1 4 5 7

输出

复制

7 6 7 7

题目描述

输入描述:

输出描述:

输入

输出

说明