for _ in range(int(input())):
n = int(input())
k = 0
k += (((n//2)-2)//3)*3 + (((n//2)-2) - ((n//2)-2)//3) + 4 + (n//2 - n//6)*3 + (n//6)*5
if n%2 != 0 :
if n%3 == 0:
k+= 3
else: k+=1
print(k)
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline void solve() {
int n;
scanf("%lld",&n);
printf("%lld\n",n+(n/2+n/3)*2);
return ;
}
signed main() {
int T;
scanf("%lld",&T);
while(T--) solve();
return 0;
} 1665C - Tree Infection | 1665D - GCD Guess |
29A - Spit Problem | 1097B - Petr and a Combination Lock |
92A - Chips | 1665B - Array Cloning Technique |
1665A - GCD vs LCM | 118D - Caesar's Legions |
1598A - Computer Game | 1605A - AM Deviation |
1461A - String Generation | 1585B - Array Eversion |
1661C - Water the Trees | 1459A - Red-Blue Shuffle |
1661B - Getting Zero | 1661A - Array Balancing |
1649B - Game of Ball Passing | 572A - Arrays |
1455A - Strange Functions | 1566B - MIN-MEX Cut |
678C - Joty and Chocolate | 1352E - Special Elements |
1520E - Arranging The Sheep | 1157E - Minimum Array |
1661D - Progressions Covering | 262A - Roma and Lucky Numbers |
1634B - Fortune Telling | 1358A - Park Lighting |
253C - Text Editor | 365B - The Fibonacci Segment |