Codeforces Round 874 (Div. 3) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

dfs and similar

dsu

graphs

shortest paths

*1600

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Round Dance

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard output$$$n$$$ people came to the festival and decided to dance a few round dances. There are at least $$$2$$$ people in the round dance and each person has exactly two neighbors. If there are $$$2$$$ people in the round dance then they have the same neighbor on each side.

You decided to find out exactly how many dances there were. But each participant of the holiday remembered exactly one neighbor. Your task is to determine what the minimum and maximum number of round dances could be.

For example, if there were $$$6$$$ people at the holiday, and the numbers of the neighbors they remembered are equal $$$[2, 1, 4, 3, 6, 5]$$$, then the minimum number of round dances is$$$1$$$:

- $$$1 - 2 - 3 - 4 - 5 - 6 - 1$$$

- $$$1 - 2 - 1$$$
- $$$3 - 4 - 3$$$
- $$$5 - 6 - 5$$$

Input

The first line contains a positive number $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases. The following is a description of the test cases.

The first line of the description of each test case contains a positive number $$$n$$$ ($$$2 \le n \le 2 \cdot 10^5$$$) — the number of people at the holiday.

The second line of the description of each test case contains $$$n$$$ integers $$$a_i$$$ ($$$1 \le a_i \le n, a_i \neq i$$$) — the number of the neighbor that the $$$i$$$th person remembered.

It is guaranteed that the test cases are correct and corresponds to at least one division of people into round dances.

It is guaranteed that the sum of $$$n$$$ for all test cases does not exceed $$$2 \cdot 10^5$$$.

Output

For each test case, output two integers — the minimum and maximum number of round dances that could be.

Example

Input

1062 1 4 3 6 562 3 1 5 6 492 3 2 5 6 5 8 9 822 144 3 2 152 3 4 5 165 3 4 1 1 253 5 4 1 266 3 2 5 4 365 1 4 3 4 2

Output

1 3 2 2 1 3 1 1 1 2 1 1 1 1 2 2 1 2 1 1

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/02/2023 20:49:13 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|