问题 M: Minimal and Maximal XOR Sum

内存限制：512 MB 时间限制：4 S

题面：传统评测方式：文本比较上传者：

提交：2 通过：1

Given a permutation p1,p2,…,pn of 1∼n. You can perform several operations.

In each operation you can choose an interval [l,r] and reverse the elements pl,pl+1,…,pr to pr,pr−1,…,pl, the weight of this operation is r−l+1.

You can perform any number of operations, and your goal is to make pi=i at last.

Please calculate the minimal and maximal XOR sum of the weight of all the operations.

The input consists of multiple test cases. The first line contains a single integer

The first line of each test case contains one integer

The second line contains …,pn.

It's guaranteed that ∑n≤6×105.

For each test case, print two integers - the minimal and maximal XOR sum of the weight of all the operations.

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

2 3
0 1
0 5

杭电多校7