#include <bits/stdc++.h>
using namespace std;
vector<long long> adj[400005], prime(15000002, 0), fact(1000005, 1), v;
long long mM(long long a, long long b, long long mod) {
  long long res = 0;
  a %= mod;
  while (b) {
    if (b & 1) res = (res + a) % mod;
    a = (2 * a) % mod;
    b >>= 1;
  }
  return res;
}
long long fpow(long long first, long long second, long long p) {
  first = first % p;
  long long res = 1;
  while (second) {
    if (second & 1) res = (res * first) % p;
    res %= p;
    if (res < 0) res = (res + p) % p;
    second = second >> 1;
    first = (first * first) % p;
    if (first < 0) first = (first + p) % p;
    first %= p;
  }
  return res;
}
long long inv(long long n) { return fpow(n, 1000000007 - 2, 1000000007); }
long long modmul(long long first, long long second) {
  return ((first % 1000000007) * (second % 1000000007)) % 1000000007;
}
long long modadd(long long first, long long second) {
  long long temp = first % 1000000007 + second % 1000000007;
  temp %= 1000000007;
  if (temp < 0) temp = (temp + 1000000007) % 1000000007;
  return temp;
}
void facto() {
  fact[0] = 1;
  for (int i = 1; i <= 1000000; i++) fact[i] = modmul(i, fact[i - 1]);
}
void sieve() {
  prime[1] = 1;
  for (long long i = 2; i < 10000005; i++)
    if (!prime[i])
      for (long long j = i; j < 10000005; j += i)
        if (!prime[j]) prime[j] = i;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long cnt = 0;
    while (n > 7) {
      n -= 7;
      cnt++;
    }
    if (n == 1)
      cnt += 2;
    else
      cnt++;
    cout << cnt << "\n";
  }
}
