#include <bits/stdc++.h>
using namespace std;
ifstream fin("input.txt");
ofstream fout("output.txt");
bool isPrime(long long int x) {
  if (x <= 4 || x % 2 == 0 || x % 3 == 0) return x == 2 || x == 3;
  for (int i = 5; i * i <= x; i += 6)
    if (x % i == 0 || x % (i + 2) == 0) return 0;
  return 1;
}
int NumDigits(int x) {
  return (
      x < 10
          ? 1
          : (x < 100
                 ? 2
                 : (x < 1000
                        ? 3
                        : (x < 10000
                               ? 4
                               : (x < 100000
                                      ? 5
                                      : (x < 1000000
                                             ? 6
                                             : (x < 10000000
                                                    ? 7
                                                    : (x < 100000000
                                                           ? 8
                                                           : (x < 1000000000
                                                                  ? 9
                                                                  : 10)))))))));
}
inline void boostIO() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
inline long long int Pow10(int x) {
  if (x == 0) return 1;
  if (x == 1) return 10;
  if (x == 2) return 100;
  if (x == 3) return 1000;
  if (x == 4) return 10000;
  if (x == 5) return 100000;
  if (x == 6) return 1000000;
  if (x == 7) return 10000000;
  if (x == 8) return 100000000;
  if (x == 9) return 1000000000;
  if (x == 10) return 10000000000;
}
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
  return a * b / gcd(a, b);
}
int32_t main() {
  boostIO();
  int t;
  cin >> t;
  for (int k = 0; k < (t); ++k) {
    int n;
    cin >> n;
    int answ = 0;
    while (n >= 7) {
      n -= 7;
      answ++;
    }
    if (n != 0) {
      answ++;
    }
    cout << answ << '\n';
  }
  return 0;
}
