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
#include <bits/stdc++.h>
#include "dzilib.h"
#define fi first
#define sc second
#define pb push_back
#define rep(i,p,k) for(int i=(p);i<(k);++i)
#define forn(i,p,k) for(int i=(p);i<=(k);++i)
#define forr(i,k,p) for(int i=(k)-1;i>=(p);--i)
#define each(a,b) for(auto&a:b)
#define all(v)  begin(v), end(v)
#define RET(smth)   return void(cout<<(smth)<<'\n');
#define sz(v) (int)v.size()
using namespace std;
using pii = pair<int,int>;
using ll = long long;
using Vi = vector<int>;
#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) ;
#endif
const int MM = 1e6 + 200;
int dv[MM];

const int C = 100;
struct MAIN {
    void TEST() {
        array<int, C> d;
        rep(i,0,C) d[i] = Ask(i);
        int ind = 1;
        while(true) {
            bool flag = true;
            rep(i,0,C) if(dv[ind+i] != d[i]) {
                flag = false;
                break;
            }
            if(flag) return Answer(ind);
            ind++;
        }
    }
};

int main() {
#ifndef DEBUG
    cin.tie(0) -> sync_with_stdio(0);
#endif
    rep(i,1,MM) for(int j=i;j<MM;j+=i) dv[j]++;
    int Z = GetT();
    while(Z--) MAIN{}.TEST();
    return 0;
}