#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	int testCase;
  cin >> testCase;
	while (testCase--) {
		vector<int> balls;
		int ball;
		cin >> ball;
		while (ball--) {
			int num;
			cin >> num;
			balls.push_back(num);
		}
		int maxNum = 1;
		int lastNum = balls[0];
		int count = 1;
		for (int i = 1;i < balls.size();i++) {
			if (balls[i] != lastNum) {
				lastNum = balls[i];
				maxNum = max(count, maxNum);
				count = 1;
			}
			else {
				count++;
			}
		}
		maxNum = max(count, maxNum);
		cout << maxNum << endl;
	}
	return 0;
}
### Prompt

Construct a cpp code solution to the problem outlined:

Nezzar has n balls, numbered with integers 1, 2, …, n. Numbers a_1, a_2, …, a_n are written on them, respectively. Numbers on those balls form a non-decreasing sequence, which means that a_i ≤ a_{i+1} for all 1 ≤ i < n.

Nezzar wants to color the balls using the minimum number of colors, such that the following holds.

  * For any color, numbers on balls will form a strictly increasing sequence if he keeps balls with this chosen color and discards all other balls. 



Note that a sequence with the length at most 1 is considered as a strictly increasing sequence.

Please help Nezzar determine the minimum number of colors.

Input

The first line contains a single integer t (1 ≤ t ≤ 100) — the number of testcases. 

The first line of each test case contains a single integer n (1 ≤ n ≤ 100).

The second line of each test case contains n integers a_1,a_2,…,a_n (1 ≤ a_i ≤ n). It is guaranteed that a_1 ≤ a_2 ≤ … ≤ a_n.

Output

For each test case, output the minimum number of colors Nezzar can use.

Example

Input


5
6
1 1 1 2 3 4
5
1 1 2 2 3
4
2 2 2 2
3
1 2 3
1
1


Output


3
2
4
1
1

Note

Let's match each color with some numbers. Then:

In the first test case, one optimal color assignment is [1,2,3,3,2,1].

In the second test case, one optimal color assignment is [1,2,1,2,1].

### Response

```cpp
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	int testCase;
  cin >> testCase;
	while (testCase--) {
		vector<int> balls;
		int ball;
		cin >> ball;
		while (ball--) {
			int num;
			cin >> num;
			balls.push_back(num);
		}
		int maxNum = 1;
		int lastNum = balls[0];
		int count = 1;
		for (int i = 1;i < balls.size();i++) {
			if (balls[i] != lastNum) {
				lastNum = balls[i];
				maxNum = max(count, maxNum);
				count = 1;
			}
			else {
				count++;
			}
		}
		maxNum = max(count, maxNum);
		cout << maxNum << endl;
	}
	return 0;
}
```