You are given an array of length . In one move, select an integer and do one of the following operations:
Find the minimum number of moves required to make the array empty.
Input format:
Output format:
For each test case, print the minimum moves needed to make the array empty.
Constraints:
For test case 1:
Hence, the minimum number of moves needed is .
For test case 2:
Hence, the minimum number of moves needed is .