The puzzle

Kayaking is playing a puzzle game containing n different blocks. He marks the blocks with integers from 1 to n, which show the blocks’ original positions. Each time he can exchange two blocks and he wants to know how many times he needs at least to restore the puzzle.

The input starts with one line contains exactly one positive integer which is the number of test cases.
Each test case contains two lines.
The first line contains an integer, which indicates the number of puzzle pieces.
The second line contains n different integers, the i-th number means the mark of the block in the i-th position.

For each test case, output one line with one number represents the minimum operations.

2
4
2 3 4 1
4
2 1 4 3

3
2

1<=T<=20,1<=n<=100000

2018 黑龙江省大学生程序设计竞赛