/*
written by- Piyush Golani
language- c++
country- India
College- N.I.T Jamshedpur
*/
#include <cmath>
#include <ctime>
#include <iostream>
#include <string>
#include <vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<map>
#include<cctype>
#include<queue>
using namespace std;
#define pb push_back
#define all(s) s.begin(),s.end()
#define f(i,a,b) for(int i=a;i<b;i++)
#define F(i,a,b) for(int i=a;i>=b;i--)
#define PI 3.1415926535897932384626433832795
#define INF 1000000005
#define BIG_INF 7000000000000000000LL
#define mp make_pair
#define eps 1e-9
#define LL long long
#define si(n) scanf("%d",&n)
#define sll(n) scanf("%lld",&n)
#define mod 1000000007



bool visited[20005];


int main()
{
    int t;
    si(t);
    while(t--)
    {
        LL n;
        sll(n);
        memset(visited,false,sizeof(visited));
        queue<LL> Q;
        Q.push(1);
        while(!Q.empty())
        {
            LL p= Q.front();
            Q.pop();
            if(visited[p%n]==1) continue;
            visited[p%n]=1;
            if(p%n==0)
            {
                printf("%lld\n",p);
                break;
            }
            Q.push(p*10);
            Q.push(p*10+1);
        }
    }
    return 0;
}