Educational Codeforces Round 56 (Rated for Div. 2) A. Dice Rolling 签到题（思维题）

Mishka got a six-faced dice. It has integer numbers from 22 to 77 written on its faces (all numbers on faces are different, so this is an almostusual dice).

Mishka wants to get exactly xx points by rolling his dice. The number of points is just a sum of numbers written at the topmost face of the dice for all the rolls Mishka makes.

Mishka doesn't really care about the number of rolls, so he just wants to know any number of rolls he can make to be able to get exactly xxpoints for them. Mishka is very lucky, so if the probability to get xx points with chosen number of rolls is non-zero, he will be able to roll the dice in such a way. Your task is to print this number. It is guaranteed that at least one answer exists.

Mishka is also very curious about different number of points to score so you have to answer tt independent queries.

Input

The first line of the input contains one integer tt (1≤t≤1001≤t≤100) — the number of queries.

Each of the next tt lines contains one integer each. The ii-th line contains one integer xixi (2≤xi≤1002≤xi≤100) — the number of points Mishka wants to get.

Output

Print tt lines. In the ii-th line print the answer to the ii-th query (i.e. any number of rolls Mishka can make to be able to get exactly xixi points for them). It is guaranteed that at least one answer exists.

Example

input

Copy

4
2
13
37
100

output

Copy

1
3
8
27

Note

In the first query Mishka can roll a dice once and get 22 points.

In the second query Mishka can roll a dice 33 times and get points 55, 55 and 33 (for example).

In the third query Mishka can roll a dice 88 times and get 55 points 77 times and 22 points with the remaining roll.

In the fourth query Mishka can roll a dice 2727 times and get 22 points 1111 times, 33 points 66 times and 66 points 1010 times.

题意：一个筛子写着2----7六个数字，问转多少次转的和可以准确的得到X。（次数任意）

PS：这个题周三晚上的训练比赛上出现了。当时也不知道这是个签到难度的题，自己思维也想错了，所以才写这篇博客的

分析：其他的不用考虑直接n/2输出就可以了，当时自己多想了对7取模特判的，

代码：

#include<iostream>
using namespace std;
int main()
{

	int n;
	cin>>n;
	for(int t=0;t<n;t++)
    {
        int k;
    	cin>>k;
    	cout<<k/2<<endl;
	 }

	return 0;
}