# Staircase

You are given

*N*bricks.You have to build a staircase.A staircase will consist of steps of different sizes in decreasing order,no two step size should be same.Each step sholud consists of atleast one brick and each staircase should consist of atleast two steps.Following is the example of staircase for

*N*=11 and

*N*=5.

Your task is to print the total possible number of staircases consisting of

*N*bricks.

**INPUT**

The first line of input contains the number of test cases T.

Each test case will contain an integer

*N*.

**OUTPUT**

For each test case print the total number of possible staircases in separate line.

**CONSTRAINT**

```
```

T <= 100

5 <= N <= 500

**SAMPLE INPUT**

```
```

7

5

6

7

8

9

10

11

**SAMPLE OUTPUT**

```
```

2

3

4

5

7

9

11

*Problem Setter : Akshay Kumar*

**Languages:**Brain,C,C++,Java,C#,JavaScript,Perl,PHP,Pascal,Python,Ruby,Text