Chef has NN 6-sided standard dice. Each die has dimensions 1×1×11×1×1. Since Chef is bored during the quarantine, he decides to stack dice for fun.

First, Chef forms four vertical stacks of dice (not necessarily with the same height; empty stacks are allowed) on his table, which together make up a pile of dice with base area up to 2×22×2. Among all such structures, the total visible surface area of Chef’s structure must be the smallest possible.

Then, Chef calculates the number of pips on the visible faces of all dice in the structure. A face of a die is visible if it does not touch the table or another die.

Now, he is wondering: among all possible arrangements of dice, what is the maximum possible total number of visible pips? Since he is busy cooking, he is asking you to solve this.

### Input

- The first line of the input contains a single integer TT denoting the number of test cases. The description of TT test cases follows.
- The first and only line of each test case contains a single integer NN.

### Output

For each test case, print a single line containing one integer ― the maximum possible number of visible pips.

### Constraints

- 1≤T≤1051≤T≤105
- 1≤N≤10121≤N≤1012

### Subtasks

**Subtask #1 (10 points):**

- T≤100T≤100
- N≤4N≤4

**Subtask #2 (10 points):**

- T≤100T≤100
- N≤8N≤8

**Subtask #3 (25 points):**

- T≤100T≤100
- N≤104N≤104

**Subtask #4 (55 points):** original constraints

### Example Input

```
1
1
```

### Example Output

```
20
```

### Explanation

**Example case 1:** There is only one die. If Chef places it on the table with 1 pip facing down, the visible pips are 2, 3, 4, 5 and 6, and their sum is 2020.

`Will be updated soon`

See more posts **here**