Minimum Spanning Tree

Problem Description

There are $n-1$ points, numbered from $2$ to $n$. The weight of the edge between point $a$ and point $b$ is $\operatorname{lcm}(a, b)$. Find the weight of the minimum spanning tree of these $n-1$ points.

Input Format

The first line contains an integer $T$.

The following $T$ lines each contain one integer $n$.

Output Format

One number: the answer.

Sample Input

2
2
6

Sample Output

0
26

Constraints

For all data, $T\le 100,\ 2\le n \le 10^7$.