TLE on #1#2#9#10 Code:

#include <bits/stdc++.h>
using namespace std;

void jde0(int n)
{
    switch(n%7)
    {
        case 0:while(n-=7)cout<<8;cout<<8;break;
        case 1:cout<<10;n-=8;while(n-=7)cout<<8;cout<<8;break;
        case 2:cout<<1;n-=2;while(n-=7)cout<<8;cout<<8;break;
        case 3:cout<<200;n-=17;while(n-=7)cout<<8;cout<<8;break;
        case 4:cout<<20;n-=11;while(n-=7)cout<<8;cout<<8;break;
        case 5:cout<<2;n-=5;while(n-=7)cout<<8;cout<<8;break;
        case 6:cout<<6;n-=6;while(n-=7)cout<<8;cout<<8;break;
    }
}

void jde(int n)
{
    switch(n)
    {
        case 1:cout<<-1;break;
        case 3:cout<<7;break;
        case 4:cout<<4;break;
        case 10:cout<<22;break;
        default:jde0(n);
    }
    cout<<"\n";
}

int main()
{
	int n,k;
	cin>>n;
	while(n--)
	{
		cin>>k;
		jde(k);
	}return 0;
}