시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 256 MB 0 0 0 0.000%

문제

A subset $A$ of the set $\{1, 2, 3, \ldots, n\}$ is called interesting if for any pair of different integers $x, y \in A$ neither $x$ divides $y$ nor $y$ divides $x$.

An interesting subset $A$ is called amazing if it has the maximum cardinality among all interesting subsets.

Finally, an amazing subset $A$ is called jaw-dropping if it has the minimum sum of elements among all amazing subsets.

Given $n$, find the sum of elements in any jaw-dropping subset of $\{1, 2, 3, \ldots, n\}$.

입력

The first line contains integer $t$ ($1 \le t \le 10^5$) --- the number of test cases.

Each of the next $T$ lines contains an integer $n_i$ ($1 \le n_i \le 10^9$).

출력

Print $T$ lines with answers for each test case.

예제 입력 1

7
1
2
3
4
5
6
7

예제 출력 1

1
1
5
5
10
10
17