#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  int n;
  cin >> n;
  if (n & 1) {
    for (int i = 3; i * i <= n; i++) {
      if (n % i == 0) {
        cout << n / i << "\n";
        return;
      }
    }
  } else cout << n / 2 << "\n";
  
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}