F-Gcd Product_第 45 届国际大学生程序设计竞赛（ICPC）亚洲区域赛（济南）

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

题目描述

Give you $n,A_{1...n},B_{1...n}$ , you need to calculate:

$C_k=\sum_{i=1}^{k}A_{gcd(i,k)}B_{gcd(k+1-i,k)}$

Because the output may be too large, let $Ans_i$ denote $C_i~mod~998244353$ , you only need to output $Ans_1~xor~Ans_2~xor~...~xor~Ans_n$

输入描述:

The first line has one integer .

The second line has  integers .

The third line has  integers .

输出描述:

Output the answer.

示例1

输入

复制

6
1 2 3 4 5 6
6 5 4 3 2 1

输出

复制