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
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define PPC(x) __builtin_popcountll(x)
#define MSB(x) (63 - __builtin_clzll(x))
#define LSB(x) __builtin_ctzll(x)
#define ARG(x, i) (get<i>(x))
#define ithBit(m, i) ((m) >> (i) & 1)
#define pb push_back
#define ft first
#define sd second
#define kw(a) ((a) * (a))
#define CLR(x) x.clear(), x.shrink_to_fit()
#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif

#include "dzilib.h"

using namespace std;
 
template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = min(a, (T1)b);	}
template <typename T1, typename T2> inline void remax(T1& a, T2 b) { a = max(a, (T1)b);	}

const int maxN = 1 << 20;

int apd[maxN], fi[maxN];

map <vector <int>, int> M;

void smallN()
{
	int n = 1'000'001, k = 17;

	n += k;
	
	iota(apd, apd+n, 0);
	for (int i=2; i*i<=n; i++)
		if (apd[i] == i)
			for (int j=i*i; j<=n; j+=i)
				apd[j] = i;

	fi[1] = 1;
	FOR(i, 2, n+1)
	{
		int p = apd[i];
		if (p == i)
			for (long long j=i; j<=n; j*=p)
				fi[j] = fi[j / p] + 1;
		else
		{
			int j = i;
			while (j % p == 0)
				j /= p;
			fi[i] = fi[j] * fi[i / j];
		}
	}

	FOR(i, 1, n-k+1)
	{
		vector <int> key;
		FOR(j, 0, k)
			key.pb(fi[i+j]);
		
		M[key] = i;
	}

	int tc = GetT();
	while (tc--)
	{
		vector <int> key;
		FOR(i, 0, k)
			key.pb(Ask(i));
		Answer(M[key]);
	}

}

void solve()
{
	if (GetN() <= 1'000'000)
		smallN();
}

int main()
{
	int t = 1;
//	scanf ("%d", &t);	
	FOR(tid, 1, t+1)
	{
		//printf("Case #%d: ", tid);
		solve();
	}
	return 0;
}