Person in Charge

• cq_irritater

Attention

The sample cases for this problem are not placed in subtask 0. Instead, they are located elsewhere:

The subtask dependencies are as follows:

File I/O is required (league.in / league.out).

Problem Background

Last time, Sleeping Dolphin's good friend Sleeping Goose lost the match, so they began preparing for the $2070$ White Goose Planet World Cup $45$ years early, hoping to shine then.
To avoid another crushing defeat, the Sleeping Super League was born.

Problem Description

There are $n$ teams in the league.

• If $n \ge 15$, the league uses a single round-robin schedule.
• Otherwise, it uses a double round-robin schedule.

Between any two matches there must be $3$ days of rest, and at most one match per day can be held.
Calculate how many days a whole season lasts.

Input Format

Multiple test cases.

First line: an integer $T$, the number of test cases.

For each test case:

One line with a positive integer $n$, the number of teams.

Output Format

For each test case, output one integer: the number of days needed for the season.

Samples

3
1
2
3

0
5
21

3
10
100
1000

357
19797
1997997

Sample 1 Explanation

• With $1$ team, no matches can be played: output $0$.
• With $2$ teams, matches $(1,2)$ and $(2,1)$ are required, scheduled on days $1$ and $5$ respectively: output $5$.
• With $3$ teams, six matches are required: $(1,2), (2,1), (1,3), (3,1), (2,3), (3,2)$, scheduled on days $1, 5, 9, 13, 17, 21$: output $21$.

Data Range

For $100\%$ of the data, $1 \le T \le 50$, $1 \le n \le 10^9$.

There are four equally-weighted subtasks:

1. $n=1$.
2. $n \le 15$.
3. $n \le 10^4$.
4. No additional constraints.