1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
// clang-format off
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include "dzilib.h"
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
template<class Fun>
class y_combinator_result {
    Fun fun_;
public:
    template<class T> explicit y_combinator_result(T &&fun): fun_(forward<T>(fun)) {}
    template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(ref(*this), forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<decay_t<Fun>>(forward<Fun>(fun)); }
// using namespace __gnu_pbds;
// template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef XOX
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; }
sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; }
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
struct { template <class T> operator T() { T x; cin >> x; return x; } } in;
#define endl '\n'
#define pb emplace_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using i64 = long long;
template <class T> using vt = vector<T>;
template <class T, size_t n> using ar = array<T, n>;
namespace R = ranges;
auto ra(auto x, auto y) { return R::iota_view(x, y); }
// #define int long long
// clang-format on

const int magic = 17;
const int nax = 1000 * 1000 + magic;
int ndivs[nax];

void prepro() {
    for (int i = 1; i < nax; i++) {
        for (int j = i; j < nax; j += i) {
            ndivs[j]++;
        }
    }
}

void solve() {
    vt<int> pat;
    for (int i = 0; i < magic; i++) {
        pat.pb(Ask(i));
    }
    for (int i = 1; i + magic - 1 < nax; i++) {
        int cnt = 0;
        for (int j = 0; j < magic; j++) {
            if (ndivs[i + j] == pat[j]) {
                cnt++;
            } else {
                break;
            }
        }
        if (cnt == magic) {
            Answer(i);
            return;
        }
    }
}

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    // int t = 1;
    prepro();
    int t = GetT();
    while (t--) {
        solve();
    }
    // set<vt<int>> s;
    // for (int i = 1; i + magic - 1 < nax; i++) {
    //     vt<int> pat;
    //     for (int j = 0; j < magic; j++) {
    //         pat.pb(ndivs[i + j]);
    //     }
    //     assert(!s.count(pat));
    //     s.insert(pat);
    // }
}