Minimum Days to Satisfy Plants' Requirements

You are given several test cases. In each test case, there are n plants. Each plant has specific water and exposure (light) requirements given by two arrays. However, note that regardless of the actual requirement values, each plant must be cared for on a separate day. Hence, the minimum number of days required to satisfy a test case is exactly n.

In more formal terms, if a test case consists of one integer n (the number of plants), followed by two arrays representing water and exposure requirements respectively, the answer for that test case is:

\(days = n\)

Even though the water and exposure values are provided, they do not affect the final result.

inputFormat

The first line contains an integer T (\(1 \leq T \leq 1000\)), the number of test cases. For each test case, the input is structured as follows:

• An integer n (\(1 \leq n \leq 10^5\)) representing the number of plants.
• A line with n space-separated integers representing the water requirements for each plant.
• A line with n space-separated integers representing the exposure (light) requirements for each plant.

It is guaranteed that the sum of all n across the test cases does not exceed \(10^6\).

outputFormat

For each test case, output a single integer on a new line — the minimum number of days required to satisfy all the plants. As discussed, this is simply n for each test case.

## sample

2
3
4 3 5
2 6 2
4
7 1 9 4
3 8 1 4

3
4

</p>