Welcome to MOI 2021!


Submit solution

Points: 100
Time limit: 1.0s
Memory limit: 256M

Author:
Problem type
Allowed languages
C++

The Moroccan Olympiad in Informatics is a great way to develop important problem-solving skills. Students who take part in the competition quickly become good at dealing with problems that involve thorough logical reasoning, algorithmic thinking, efficiency, and optimization.

With this in mind, MOI contestants are therefore sometimes invited to compete in other programming contests in teams of up to three students. Your task is to help make these teams.

Given the number of MOI contestants, we'd like you to find the minimum number of teams that can be constructed out of all the students if teams can comprise from one to three students.

Input Specification

The first line of the input contains an integer \(T\) - the number of cases we'd like you to answer.

\(T\) lines follow. Each line contains a single integer \(1 \leq n \leq 10^9\), the number of MOI contestants.

Output Specification

For each test case, in a new line, output a single integer -- the minimum number of groups that satisfy the aforementioned constraints.

Sample Input

3
9
5
7

Sample Output

3
2
3

Notes

In the first test case, we can make three teams of 3 students and we can't make less than 3.

In the second test case, we can make a team of 3 students and a team of 2 students which is optimal.


Comments

There are no comments at the moment.