13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T5d4,

We have hidden from you a string of length 11.

Given an integer $$$i$$$, find the $$$i$$$-th character of this string.

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \leq t \leq 20$$$). The description of the test cases follows.

The first line of each test case contains a single integer $$$i$$$ ($$$1 \leq i \leq 11$$$).

Output

For each test case, output the $$$i$$$-th character.

Note

We actually don't intend for this problem to be solvable, so you should go try other problems. Wait for the contest to end and read the editorial.

If, somehow, a person gets Accepted through what we deem is unacceptable behaviour, he will be disqualified. We will also take great care in making sure the answer is not leaked anywhere during the contest.

After contest update: It seems someone had br

Anomaly

Examples