Codeforces Round 697 (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.

dp

math

number theory

sortings

*1900

No tag edit access

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

×
G. Strange Beauty

time limit per test

5 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPolycarp found on the street an array $$$a$$$ of $$$n$$$ elements.

Polycarp invented his criterion for the beauty of an array. He calls an array $$$a$$$ beautiful if at least one of the following conditions must be met for each different pair of indices $$$i \ne j$$$:

- $$$a_i$$$ is divisible by $$$a_j$$$;
- or $$$a_j$$$ is divisible by $$$a_i$$$.

For example, if:

- $$$n=5$$$ and $$$a=[7, 9, 3, 14, 63]$$$, then the $$$a$$$ array is not beautiful (for $$$i=4$$$ and $$$j=2$$$, none of the conditions above is met);
- $$$n=3$$$ and $$$a=[2, 14, 42]$$$, then the $$$a$$$ array is beautiful;
- $$$n=4$$$ and $$$a=[45, 9, 3, 18]$$$, then the $$$a$$$ array is not beautiful (for $$$i=1$$$ and $$$j=4$$$ none of the conditions above is met);

Ugly arrays upset Polycarp, so he wants to remove some elements from the array $$$a$$$ so that it becomes beautiful. Help Polycarp determine the smallest number of elements to remove to make the array $$$a$$$ beautiful.

Input

The first line contains one integer $$$t$$$ ($$$1 \leq t \leq 10$$$) — the number of test cases. Then $$$t$$$ test cases follow.

The first line of each test case contains one integer $$$n$$$ ($$$1 \leq n \leq 2 \cdot 10^5$$$) — the length of the array $$$a$$$.

The second line of each test case contains $$$n$$$ numbers $$$a_1, a_2, \ldots, a_n$$$ ($$$1 \le a_i \le 2 \cdot 10^5$$$) — elements of the array $$$a$$$.

Output

For each test case output one integer — the minimum number of elements that must be removed to make the array $$$a$$$ beautiful.

Example

Input

4 5 7 9 3 14 63 3 2 14 42 4 45 9 3 18 3 2 2 8

Output

2 0 1 0

Note

In the first test case, removing $$$7$$$ and $$$14$$$ will make array $$$a$$$ beautiful.

In the second test case, the array $$$a$$$ is already beautiful.

In the third test case, removing one of the elements $$$45$$$ or $$$18$$$ will make the array $$$a$$$ beautiful.

In the fourth test case, the array $$$a$$$ is beautiful.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/06/2023 04:17:20 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|