Time Limit: 1.0 s

Memory Limit: 256.0 MB

Description

Mazhar loves ODD numbers. Because he always wants to be first. Roy has prepared a problem to impress him. The problem is very simple,
You are given a number \(N\).You need to find out how many numbers between 1 to N (inclusive) are ODD.

Some ODD Numbers are : 1,3,5,7,9,11,13...

Unfortunately, Mazhar is busy with bike riding and need your help to solve this problem. Can you solve this on behalf of Mazhar ?

Input

First line of input takes an integer \(T\) : number of testcases
Each of the next \(T\) lines takes an integer \(N\)
1 <= \(T\) <= 10
1 <= \(N\) <= \(10^5\)

Output

Output \(T\) integers on each line : number of odd numbers from 1 to \(N\)

Sample

2
3
4

2
2

In the first test case,N=3

1 and 3 are the only odd numbers from 1 to 3. so the answer is 2