import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


bool isKadomatsu(int a, int b, int c) {
  return (a != b && a != c && b != c && ((a < b && b > c) || (a > b && b < c)));
}

enum LIM = 16;

long K;

void main() {
  auto dp = new long[][][](LIM, 10, 10);
  foreach (a; 0 .. 10) foreach (b; 0 .. 10) {
    dp[0][a][b] = 1;
  }
  foreach (n; 1 .. LIM) {
    foreach (a; 0 .. 10) foreach (b; 0 .. 10) {
      foreach (c; 0 .. 10) {
        if (isKadomatsu(a, b, c)) {
          dp[n][a][b] += dp[n - 1][b][c];
        }
      }
    }
  }
  
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        K = readLong();
        
        long k = K;
        foreach (n; 3 .. LIM) {
          foreach (a; 1 .. 10) foreach (b; 0 .. 10) {
            if (k > dp[n - 2][a][b]) {
              k -= dp[n - 2][a][b];
            } else {
              auto x = new int[n];
              x[0] = a;
              x[1] = b;
              foreach (i; 2 .. n) {
                for (x[i] = 0; x[i] < 10; ++x[i]) {
                  if (isKadomatsu(x[i - 2], x[i - 1], x[i])) {
                    const tmp = dp[n - 1 - i][x[i - 1]][x[i]];
                    if (k > tmp) {
                      k -= tmp;
                    } else {
                      break;
                    }
                  }
                }
                assert(x[i] < 10);
              }
              foreach (i; 0 .. n) {
                write(x[i]);
              }
              writeln();
              goto found;
            }
          }
        }
       found:
      }
    }
  } catch (EOFException e) {
  }
}