Ran feels boring at home, and wants to propose a math problem with Yukari and Chen!
So here's The Yakumo Family Problem:
Given an integer array aaa, try to calculate the value of the following equation modulo 998244353998244353998244353:
XOR(l,r)XOR(l,r)XOR(l,r) means al⊕al+1⊕al+2⋯⊕ara_l\oplus a_{l+1}\oplus a_{l+2}\dots\oplus a_ral⊕al+1⊕al+2⋯⊕ar, and ⊕\oplus⊕ means bitwise XOR.
输入格式
The first line contains one integer nnn (3≤n≤2×1053\le n\le 2\times 10^53≤n≤2×105), which means the length of aaa.
The next line contains nnn integers, the iii-th integer means the value of aia_iai (0≤ai≤1090\le a_i\le 10^90≤ai≤109).
输出格式
One integer, means the value of the equation modulo 998244353998244353998244353.