#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t;
ll bi=0;
ll n=10;
ll shu;
ll c[100];
ll b[100005]={0,-1,1,7,4,2,6,8,10,18,22,20,28,68,88};
ll kao[10]={1,1,2,2,2,6,8};
ll cao[10]={2,2,5,5,5,6,7};
int main(){
    cin>>t;
	for(int i=1;i<=t;i++){
		cin>>c[i];
		bi=max(bi,c[i]);
	}
	for(int i=15;i<=100005;i++){
		shu=(i-1)%7;
		if(shu==0)n*=10;
		b[i]=kao[shu]*n+b[i-cao[shu]];
		if(shu==0||shu==3)b[i]-=6*(n/10);
	}
	for(int i=1;i<=t;i++){
		cout<<b[c[i]]<<endl;
	}
}