#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<long long,long long>;
using veci = vector<int>;
using vecl = vector<long long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
const int MOD = 998244353;
const double pi = acos(-1);
ll gcd(ll a, ll b) {if(b == 0) return a; else return gcd(b,a%b);}
ll lcm(ll a, ll b) {return a*b/gcd(a,b);}

ll pow(ll n, ll a){
    ll ans = 1;
    REP(i,n) ans *= a;
    return ans;
}

int main() {
    int n; cin >> n;
    veci d(n);

    REP(i,n) cin >> d[i];

    REP(i,n) if(d[i] == 1) cout << 10 << endl;
    else cout << 9 * pow(10,d[i]-1) << endl;
}