C-This problem is difficult

Time Limit: +MSMemory Limit:32768KB64bit IO Format:%i64d &%i64uSubmitStatus

Description

A certain prison contains a long hall of n cells, each of which is next to the other. Each cell had a prisoner in it, and each cell was locked.
One night, the jailer gets bored and decides to play a game. For Round 1 of the game, he takes a drink of whiskey, and then runs to the hall unlocking each cell. For Round 2, he takes a drink of whiskey, and then runs to the hall locking every other cell (cells 2, 4, 6, ...). For Round 3, he takes a drink of whiskey, and then runs down the hall. He visits every third cell (cells 3, 6, 9, ...). If the cell is locked, he unlocks it; If it is unlocked, he locks it. He repeats this for n rounds, takes a final drink, and passes out.

Some number of prisoners, possibly zero, realizes that their cells was unlocked and the jailer is incapacitated. They immediately escape.

Given the number of cells, determine how many prisoners escape jail.

Input

The first line of input contains a single positive integer. This is the number of lines that follow. Each of the following lines contains a single integer between 5 and over, inclusive, which is the number of cells N.

Output

For each line, you must print out the number of prisoners, which escape when the prison have n cells.

Sample Input

Sample Output

#include <stdio.h>int main () {int n,m;scanf ("%d", &n);      while (n--)    {int i,x[1000];scanf ('%d ', &m), for (i=1;i<=m;i++) X[i]=0;int t=2;while (m>=t) {x[t]=1;t=t+2;} int w=3,q=3;       int H=m-2;while (h--) {    while (m>=w)    {  if (x[w]==0)  x[w]=1;  else x[w]=0;   w=w+q;    }    q++;    W=q;} int Sum=0;for (i=1;i<=m;i++) if (x[i]==0) sum++;p rintf ("%d\n", sum);} return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

C-This problem is difficult