Review Site
Contest: Educational Codeforces Round 107 (Rated for Div. 2)
Difficulty rating: 800
Tags: greedy

You are an upcoming movie director, and you have just released your first movie. You have also launched a simple review site with two buttons to press — upvote and downvote.

However, the site is not so simple on the inside. There are two servers, each with its separate counts for the upvotes and the downvotes.

$$$n$$$ reviewers enter the site one by one. Each reviewer is one of the following types:

- type $$$1$$$: a reviewer has watched the movie, and they like it — they press the upvote button;
- type $$$2$$$: a reviewer has watched the movie, and they dislike it — they press the downvote button;
- type $$$3$$$: a reviewer hasn't watched the movie — they look at the current number of upvotes and downvotes of the movie on the server they are in and decide what button to press. If there are more downvotes than upvotes, then a reviewer downvotes the movie. Otherwise, they upvote the movie.

Each reviewer votes on the movie exactly once.

Since you have two servers, you can actually manipulate the votes so that your movie gets as many upvotes as possible. When a reviewer enters a site, you know their type, and you can send them either to the first server or to the second one.

What is the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to?

Input format:
The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of testcases.

Then the descriptions of $$$t$$$ testcases follow.

The first line of each testcase contains a single integer $$$n$$$ ($$$1 \le n \le 50$$$) — the number of reviewers.

The second line of each testcase contains $$$n$$$ integers $$$r_1, r_2, \dots, r_n$$$ ($$$1 \le r_i \le 3$$$) — the types of the reviewers in the same order they enter the site.

Output format:
For each testcase print a single integer — the maximum total number of upvotes you can gather over both servers if you decide which server to send each reviewer to.

Constraints:
Time limit: 2.0 s
Memory limit: 256.0 MB

Note:
In the first testcase of the example you can send the only reviewer to either of the servers — they'll downvote anyway. The movie won't receive any upvotes.

In the second testcase of the example you can send all reviewers to the first server:

- the first reviewer upvotes;
- the second reviewer downvotes;
- the last reviewer sees that the number of downvotes is not greater than the number of upvotes — upvote themselves.

There are two upvotes in total. Alternatevely, you can send the first and the second reviewers to the first server and the last reviewer — to the second server:

- the first reviewer upvotes on the first server;
- the second reviewer downvotes on the first server;
- the last reviewer sees no upvotes or downvotes on the second server — upvote themselves.

Example input:
4
1
2
3
1 2 3
5
1 1 1 1 1
3
3 3 2

Example output:
0
2
5
2

Editorial:
Notice that the answer depends only on the number of the reviewers of the third type who upvote the movie. Optimally we would want every single reviewer of the third type to upvote. We can achieve it with the following construction: send all reviewers of the first type to the first server, all reviewers of the second type to the second server and all reviewers of the third type to the first server. Since there are no downvotes on the first server, all reviewers of the third type will upvote.
Thus, the answer is the total number of reviewers of the first and the third type.
Overall complexity: $$$O(n)$$$ per testcase.