#include<cstdio>
#include<iostream>
#include<string.h>
using namespace std;
typedef long long ll;
int k;
ll n;
ll s[100000];
int result;
void search(int l,int r)
{
int mid=(l+r)/2;
if(s[mid]<n&&s[mid+1]>=n)
{
result=mid;
return;
}
if(s[mid]>=n)
search(l,mid-1);
if(s[mid+1]<n)
search(mid+1,r);
}
int main()
{
scanf("%d",&k);
s[1]=1;
for(int i=2;i<=65540;i++)
{
s[i]=s[i-1]+i;
}
while(k--)
{
cin>>n;
search(1,65536);
ll ans;
ans=n-s[result];
ans=ans%9;
if(ans==0) ans=9;
printf("%lld\n",ans);
}
return 0;
}