// FOR THE TRANSCENDENTAL PLEASURE OF SRI SRI RADHA RAS BIHARI 

/* hare krishna hare krishna
   krishna krishna hare hare
   hare rama hare rama
   rama rama hare hare
*/



#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define SORT(name) sort(name.begin(), name.end())
#define endl "\n"
#define IN(var, type) type var; cin >> var
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define VEC(type) vector< type > 
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define scanarr(a,b,c) for( i=b;i<c;i++)cin>>a[i]
#define showarr(a,b,c) for( i=b;i<c;i++)cout<<a[i]<<' '
#define ln cout<<'\n'
template <typename T>
ostream& operator<<(ostream& os, vector<T>& v)
{
    for (auto e : v) os << e << " ";
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, pair <T, T> &p)
{
    os << "{" << p.first << ", " << p.second << "}";
    return os;
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
#define in          insert
#define b_s         binary_search
#define l_b         lower_bound
#define u_b         upper_bound
#define ar array
#define ll long long
#define ld long double
#define sza(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define setbits(n)      __builtin_popcount(n)
#define dbs(n)       bitset<32>(n).to_string()
#define      Ceil(x,y)           ((x+y-1)/y)
#define      gcd(a,b)            __gcd(a,b)
#define      lcm(a,b)           (a*b)/gcd(a,b)
#define      HareKrishna      ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
const int MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
// -----------------------
// bool isval(int x, int y, int n, int m)
// {
//     if(x<1 || y<1 || x>n || y>m)
//         return false;
//     return true;
// }
// int dx[4] = {0, 1, 0, -1};
// int dy[4] = {1, 0, -1, 0};

// -----------------------
long long int const mod = 1e9+7;
long long int inverse_modulo(long long int p, long long int q)
{
    long long int expo = mod - 2;
    while (expo) {
        if (expo & 1) {
            p = (p * q) % mod;
        }
        q = (q * q) % mod;
        expo >>= 1;
    }
    return p;
}
// long long int const inverse = inverse_modulo(1, 4);

long long binpow(long long a, long long n) {
    long long res = 1;
    while (n > 0) {
        if (n & 1)
            res = res * a;
        a = a * a;
        n >>= 1;
    }
    return res;
}

void solution() {
 ll n,i;cin>>n;
        cout<<n-(n/5)<<endl;
    
}
int32_t main() {
   HareKrishna;

    int T;
    cin >> T;
    for (int t = 0; t < T; t++)
    {
        solution();
    }

    return 0;
}

// FOR THE TRANSCENDENTAL PLEASURE OF SRI SRI RADHA RAS BIHARI