#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool check(int x) {
    while (x) {
        if (x % 10 == 7) {
            return true;
        }

        x /= 10;
    }

    return false;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    vector<int> queries(T);

    for (int i = 0; i < T; ++i) {
        cin >> queries[i];
    }

    int max_x = *max_element(queries.begin(), queries.end());
    int N = max_x + 100000;
    vector<bool> f(N, false);
    vector<int> nx(N, 0);
    int ls = 0;

    for (int i = 1; i < N; ++i) {
        if (f[i]) {
            continue;
        }

        if (check(i)) {
            for (int j = i; j < N; j += i) {
                f[j] = true;
            }

            continue;
        }

        nx[ls] = i;
        ls = i;
    }

    for (int x : queries) {
        if (x >= N || f[x]) {
            cout << "-1\n";
        } else {
            cout << nx[x] << "\n";
        }
    }

    return 0;
}