题目描述

$\textit{Chuanpai}$(川牌) is a kind of traditional playing cards in Sichuan. Each card is marked with two integers $x$ and $y$ where $1 \le x \le y \le 6$.

:::align{center} Some samples of Chuanpai.

The first one is marked with $3$ and $4$, while the second one is marked with $2$ and $5$. :::

Given an integer $k$, please count the number of different types of cards satisfying $x + y = k$.

We say two cards with integers $x_1$, $y_1$ and $x_2$, $y_2$ are of different types if $x_1 \ne y_1$ or $x_2 \ne y_2$.

输入格式

There are multiple test cases. The first line of the input contains an integer $T$ ($1 \le T \le 100$) indicating the number of test cases. For each test case:

The first and only line contains an integer $k$ ($1 \le k \le 100$).

输出格式

For each test case output one line containing one integer, indicating the number of types of cards satisfying $x + y = k$.

4
4
5
8
100

2
2
3
0

提示

We use $(a, b)$ to indicate a type of card whose $x = a$ and $y = b$.

For the first sample test case the valid types of cards are $(1, 3)$ and $(2, 2)$.

For the second sample test case the valid types of cards are $(1, 4)$ and $(2, 3)$.

For the third sample test case the valid types of cards are $(2, 6)$, $(3, 5)$ and $(4, 4)$.