1266: 2-3 Moves

内存限制:128 MB 时间限制:1.000 S 标准输入输出
题目类型:传统 评测方式:文本比较 上传者:
提交:18 通过:10 通过率:55.556%

题目描述

You are standing at the point 0 on a coordinate line. Your goal is to reach the point nn. In one minute, you can move by 2 or by 3 to the left or to the right (i. e., if your current coordinate is x, it can become x - 3, x - 2, x + 2 or x + 3). Note that the new coordinate can become negative.

Your task is to find the minimum number of minutes required to get from the point 0 to the point n.

You have to answer t independent test cases.

输入格式

The first line of the input contains one integer t (1  104) — the number of test cases. Then t lines describing the test cases follow.
The i-th of these lines contains one integer n (1 ≤ n ≤ 109) — the goal of the i-th test case.

输出格式

For each test case, print one integer — the minimum number of minutes required to get from the point 0 to the point n for the corresponding test case.

输入样例 复制

4
1
3
4
12

输出样例 复制

2
1
2
4