#include <bits/stdc++.h>
using namespace std;

int part(int n) {
    for (int length = 2; length <= n / 2; ++length) {
        if (n % length != 0) {
            continue;
        }
        
        bool is_possible = true;
        for (int i = 0; i < n; i += length) {
            int max_element = i + length;
            int min_element = i + 1;
            for (int j = i + 1; j < i + length; ++j) {
                if (max_element < n && max_element < j + 1) {
                    max_element = j + 1;
                }
                if (min_element < n && min_element > j + 1) {
                    min_element = j + 1;
                }
            }
            if (abs(max_element - min_element) != 1) {
                is_possible = false;
                break;
            }
        }
        
        if (is_possible) {
            return n / length;
        }
    }
    
    return 1;
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        int n;
        cin >> n;
        cout << part(n) << endl;
    }
    return 0;
}