#include<iostream>
#include<cmath>
using namespace std;
bool check(int a[], int n);
int huanghou(int n);
int main()
{
int n, m;
cin>>n;
while(n--)
{
cin>>m;
huanghou(m);
}
return 0;
}
int huanghou(int n)
{
int a[9];
int count = 1;
int k=1, i;
a[1] = 0;
int all[100][100];
while(k)
{
a[k] = a[k]+1;
while((a[k]<=8)&&(!check(a, k)))
{
a[k] = a[k] +1;
}
if(a[k]<=8)
{
if(k == 8)
{
for(i=1; i<=8; i++)
{
all[count][i] = a[i];
}
count++;
}
else
{
k = k+1;
a[k] = 0;
}
}
else
{
k = k-1;
}
}
for(i=1; i<=8; i++)
cout<<all[n][i];
cout<<endl;
}
bool check(int a[], int n)
{
for(int i=1; i<=n-1; i++)
{
if(abs(a[i] - a[n])==n-i || (a[i] == a[n]))
return 0;
}
return 1;
}
#include<cmath>
using namespace std;
bool check(int a[], int n);
int huanghou(int n);
int main()
{
int n, m;
cin>>n;
while(n--)
{
cin>>m;
huanghou(m);
}
return 0;
}
int huanghou(int n)
{
int a[9];
int count = 1;
int k=1, i;
a[1] = 0;
int all[100][100];
while(k)
{
a[k] = a[k]+1;
while((a[k]<=8)&&(!check(a, k)))
{
a[k] = a[k] +1;
}
if(a[k]<=8)
{
if(k == 8)
{
for(i=1; i<=8; i++)
{
all[count][i] = a[i];
}
count++;
}
else
{
k = k+1;
a[k] = 0;
}
}
else
{
k = k-1;
}
}
for(i=1; i<=8; i++)
cout<<all[n][i];
cout<<endl;
}
bool check(int a[], int n)
{
for(int i=1; i<=n-1; i++)
{
if(abs(a[i] - a[n])==n-i || (a[i] == a[n]))
return 0;
}
return 1;
}