Minimum Number of Scarecrows

You are given \(T\) test cases. For each test case, you are provided with the number of trees that need guarding. A single scarecrow can cover up to 3 consecutive trees. Your task is to calculate the minimum number of scarecrows required so that all trees are guarded. The formula to compute the number of scarecrows for \(N\) trees is given by:

$$\text{scarecrows} = \left\lceil \frac{N}{3} \right\rceil$$

Be sure to handle multiple test cases efficiently.

inputFormat

The first line of input contains an integer \(T\) (\(1 \le T \le 10^5\)), the number of test cases. Each of the next \(T\) lines contains a single integer \(N\) (\(1 \le N \le 10^9\)), representing the number of trees in that test case.

outputFormat

For each test case, output the minimum number of scarecrows needed, each on a separate line.

## sample

3
5
8
1

2
3
1

</p>