CF1555A.PizzaForces

PizzaForces is Petya's favorite pizzeria. PizzaForces makes and sells pizzas of three sizes: small pizzas consist of $6$ slices, medium ones consist of $8$ slices, and large pizzas consist of $10$ slices each. Baking them takes $15$, $20$ and $25$ minutes, respectively.

Petya's birthday is today, and $n$ of his friends will come, so he decided to make an order from his favorite pizzeria. Petya wants to order so much pizza that each of his friends gets at least one slice of pizza. The cooking time of the order is the total baking time of all the pizzas in the order.

Your task is to determine the minimum number of minutes that is needed to make pizzas containing at least $n$ slices in total. For example:

• if $12$ friends come to Petya's birthday, he has to order pizzas containing at least $12$ slices in total. He can order two small pizzas, containing exactly $12$ slices, and the time to bake them is $30$ minutes;
• if $15$ friends come to Petya's birthday, he has to order pizzas containing at least $15$ slices in total. He can order a small pizza and a large pizza, containing $16$ slices, and the time to bake them is $40$ minutes;
• if $300$ friends come to Petya's birthday, he has to order pizzas containing at least $300$ slices in total. He can order $15$ small pizzas, $10$ medium pizzas and $13$ large pizzas, in total they contain $15 \cdot 6 + 10 \cdot 8 + 13 \cdot 10 = 300$ slices, and the total time to bake them is $15 \cdot 15 + 10 \cdot 20 + 13 \cdot 25 = 750$ minutes;
• if only one friend comes to Petya's birthday, he can order a small pizza, and the time to bake it is $15$ minutes.

PizzaForces 是 Petya 最爱的披萨店。PizzaForces 制作并销售三种尺寸的披萨：小号披萨包含 $6$ 片，中号披萨包含 $8$ 片，大号披萨包含 $10$ 片。它们的烘焙时间分别为 $15$、$20$ 和 $25$ 分钟。

今天是 Petya 的生日，将有 $n$ 位朋友前来参加，因此他决定从这家最爱的披萨店下单。Petya 希望订购足够多的披萨，使得每位朋友至少能分到一片披萨。订单的烹饪时间等于订单中所有披萨的烘焙时间之和。

你的任务是确定制作总共至少包含 $n$ 片披萨所需的最少分钟数。例如：

• 若有 $12$ 位朋友来参加 Petya 的生日聚会，则他需订购总共至少 $12$ 片披萨。他可以订购两个小号披萨，恰好共 $12$ 片，烘焙时间为 $30$ 分钟；
• 若有 $15$ 位朋友来参加 Petya 的生日聚会，则他需订购总共至少 $15$ 片披萨。他可以订购一个小号披萨和一个大号披萨，共 $16$ 片，烘焙时间为 $40$ 分钟；
• 若有 $300$ 位朋友来参加 Petya 的生日聚会，则他需订购总共至少 $300$ 片披萨。他可以订购 $15$ 个小号披萨、$10$ 个中号披萨和 $13$ 个大号披萨，总计 $15 \cdot 6 + 10 \cdot 8 + 13 \cdot 10 = 300$ 片，总烘焙时间为 $15 \cdot 15 + 10 \cdot 20 + 13 \cdot 25 = 750$ 分钟；
• 若仅有 $1$ 位朋友来参加 Petya 的生日聚会，则他可订购一个小号披萨，烘焙时间为 $15$ 分钟。

The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of testcases.

Each testcase consists of a single line that contains a single integer $n$ ($1 \le n \le 10^{16}$) — the number of Petya's friends.

第一行包含一个整数 $t$（$1 \le t \le 10^4$）——测试用例的数量。

每个测试用例由一行组成，该行包含一个整数 $n$（$1 \le n \le 10^{16}$）——Petya 的朋友数量。

For each testcase, print one integer — the minimum number of minutes that is needed to bake pizzas containing at least $n$ slices in total.

对于每个测试用例，输出一个整数——烤制总共至少包含 $n$ 片的披萨所需的最少分钟数。