#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcount
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//const int INF = 1001001001;
const ll INF = 1e18;
//using mint = modint1000000007;
//using mint = modint998244353;
int di[4] = {0,-1,0,1};
int dj[4] = {-1,0,1,0};

void solve(){
    ll n;
    cin >> n;
    for(ll l = 1;l <= INF;l++){
        ll k = 1;
        ll t = 3*l;
        ll m = t-n;
        ll tmp = m;
        if(m < 0) continue;
        while(tmp != 0){
            k *= 10;
            tmp /= 10;
        }
        ll b = k*n+m;
        ll a = n+m;
        if(b%a == 0){
            cout << m << endl;
            return;
        }
    }
}

int main(){
    int t;
    cin >> t;
    while(t--) solve();
}