Your teacher gave you an assignment — given an integer N, construct a binary string B = b_{1b}_2b_{3}\ldots b_{N} of length N such that:

\max(b_{i}, b_{i+1}) = 1

for every i from 1 to N-1.

What is the minimum number of 1's such a binary string can contain?

Note: A binary string is a string consisting of only the digits 0 and 1.

------ Input Format ------ 

- The first line of input will contain a single integer T, denoting the number of test cases.
- Each test case contains a single integer N — the length of binary string you'd like to construct.
   
------ Output Format ------ 

For each test case, output on a new line the minimum number of 1's required to complete the assignment.

------ Constraints ------ 

$1 ≤ T ≤ 1000$
$2 ≤ N ≤ 1000$

----- Sample Input 1 ------ 
6
6
8
2
3
5
100
----- Sample Output 1 ------ 
3
4
1
1
2
50
----- explanation 1 ------ 
Test case $1$: One possible binary string is $\texttt{010101}$. This has three $1$'s, and it can be verified that the maximum of any two adjacent characters is $1$.  
Achieving this with less than three $1$'s is not possible.

Test case $2$: One possible binary string is $\texttt{10101010}$. This has four $1$'s, and it can be verified that the maximum of any two adjacent characters is $1$.  
Achieving this with less than four $1$'s is not possible.

Test case $3$: One possible binary string is $\texttt{10}$. This has one $1$, and it can be verified that the maximum of any two adjacent characters is $1$.  

Test case $4$: One possible binary string is $\texttt{010}$. This has one $1$, and it can be verified that the maximum of any two adjacent characters is $1$.

Source: codechef | Difficulty: EASY
Tags: Mathematics


Solutions:
for i in range(int(input())):
	n = int(input())
	print(n // 2)


for i in range(int(input())):
	x = int(input())
	print(x // 2)


t = int(input())
for tc in range(t):
	n = int(input())
	print(n // 2)


y = int(input())
for i in range(0, y):
	a = int(input())
	print(a // 2)


t = int(input())
for u in range(t):
	N = int(input())
	print(N // 2)


t = int(input())
while t > 0:
	print(int(input()) // 2)
	t -= 1


import math
for i in range(int(input())):
	x = int(input())
	print(math.floor(x / 2))


t = int(input())
for i in range(t):
	N = int(input())
	a = N // 2
	print(a)


for i in range(0, int(input())):
	n = int(input())
	if n > 0:
		print(n // 2)
	else:
		print(0)


t = int(input())
for i in range(t):
	a = int(input())
	val = a // 2
	print(val)


t = int(input())
for _ in range(t):
	n = int(input())
	print(n // 2)


for _ in range(int(input())):
	N = int(input())
	print(N // 2)


T = int(input())
for t in range(T):
	n = int(input())
	ans = n // 2
	print(ans)


n = int(input())
for i in range(n):
	x = int(input())
	a = x // 2
	print(a)


import math
T = int(input())
for i in range(T):
	N = int(input())
	print(math.floor(N / 2))


T = int(input())
for i in range(T):
	N = int(input())
	print(N // 2)


T = int(input())
for _ in range(T):
	n = int(input())
	k = int(n / 2)
	print(k)


for i in range(int(input())):
	n = int(input())
	import math as m
	print(m.floor(n / 2))


t = int(input())
for i in range(t):
	N = int(input())
	NoOfOne = N // 2
	print(NoOfOne)


t = int(input())
for i in range(t):
	N = int(input())
	if N % 2 == 1:
		print((N + 1) // 2 - 1)
	else:
		print(N // 2)


t = int(input())
for i in range(0, t):
	a = int(input())
	print(a // 2)


import math
for i in range(int(input())):
	n = int(input())
	if n % 2 == 0:
		print(n // 2)
	else:
		print(math.floor(n / 2))


for i in range(int(input())):
	a = int(input())
	print(a // 2)


t = int(input())
for i in range(t):
	n = int(input())
	if n // 2:
		print(n // 2)


for t in range(int(input())):
	x = int(input())
	print(int(x / 2))


T = int(input())
for tc in range(T):
	N = int(input())
	print(int(N / 2))


t = int(input())
i = 1
while i <= t:
	n = int(input())
	m = n // 2
	print(m)
	i = i + 1


t = int(input())
for i in range(t):
	n = int(input())
	a = n // 2
	print(a)


T = int(input())
for i in range(1, T + 1):
	a = int(input())
	print(a // 2)


t = int(input())
for _ in range(t):
	str_len = int(input())
	print(str_len // 2)


import math
for _ in range(int(input())):
	n = int(input())
	print(math.floor(n / 2))


n = int(input())
for _ in range(n):
	x = int(input())
	print(x // 2)


t = int(input())
while t:
	n = int(input())
	print(int(n / 2))
	t = t - 1


n = int(input())
for i in range(n):
	x = int(input())
	if x % 2 == 0:
		print(x // 2)
	elif x % 2 != 0:
		y = x / 2 - 0.5
		y = int(y)
		print(y)


T = int(input())
while T > 0:
	N = int(input())
	print(N // 2)
	T = T - 1