#include <bits/stdc++.h>
using namespace std;
void readi(int &x) {
  int v = 0, f = 1;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = v * 10 + c - '0';
  while (isdigit(c = getchar())) v = v * 10 + c - '0';
  x = v * f;
}
void readll(long long &x) {
  long long v = 0ll, f = 1ll;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = v * 10 + c - '0';
  while (isdigit(c = getchar())) v = v * 10 + c - '0';
  x = v * f;
}
void readc(char &x) {
  char c;
  while ((c = getchar()) == ' ')
    ;
  x = c;
}
void writes(string s) { puts(s.c_str()); }
void writeln() { writes(""); }
void writei(int x) {
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
void writell(long long x) {
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
inline long long inc(int &x) { return ++x; }
inline long long inc(long long &x) { return ++x; }
inline long long inc(int &x, long long y) { return x += y; }
inline long long inc(long long &x, long long y) { return x += y; }
inline double inc(double &x, double y) { return x += y; }
inline long long dec(int &x) { return --x; }
inline long long dec(long long &x) { return --x; }
inline long long dec(int &x, long long y) { return x -= y; }
inline long long dec(long long &x, long long y) { return x -= y; }
inline double dec(double &x, double y) { return x -= y; }
inline long long mul(int &x) { return x = ((long long)x) * x; }
inline long long mul(long long &x) { return x = x * x; }
inline long long mul(int &x, long long y) { return x *= y; }
inline long long mul(long long &x, long long y) { return x *= y; }
inline double mul(double &x, double y) { return x *= y; }
inline long long divi(int &x) { return x = sqrt(x); }
inline long long divi(long long &x) { return x = sqrt(x); }
inline long long divi(int &x, long long y) { return x /= y; }
inline long long divi(long long &x, long long y) { return x /= y; }
inline double divi(double &x, double y) { return x /= y; }
inline long long mod(int &x, long long y) { return x %= y; }
inline long long mod(long long &x, long long y) { return x %= y; }
int n, m, i, j;
string st, ans;
bool fnd;
void dfs(int x, int y, bool lim) {
  if (x >= st.length()) {
    if (!y) fnd = 1;
    return;
  }
  int t = __builtin_popcount(y);
  if (t > st.length() - x) return;
  int i;
  for (i = (lim ? st[x] - '0' : 9); i >= 0; i--) {
    if (t == st.length() - x && (!((1 << i) & y))) continue;
    ans.push_back(i + '0');
    dfs(x + 1, y ^ (1 << i), lim && (i == st[x] - '0'));
    if (fnd) return;
    ans.pop_back();
  }
}
bool spj(string st) {
  int i;
  if (st[0] != '1') return 0;
  if (st[st.length() - 1] > '1') return 0;
  if ((1) <= (((int)st.length() - 2)))
    for (((i)) = (1); ((i)) <= (((int)st.length() - 2)); ((i))++)
      if (st[i] != '0') return 0;
  if ((1) <= (((int)st.length() - 2)))
    for (((i)) = (1); ((i)) <= (((int)st.length() - 2)); ((i))++) cout << '9';
  cout << endl;
  return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  ;
  cin >> n;
  while (n--) {
    cin >> st;
    if (spj(st)) continue;
    st[st.length() - 1]--;
    for (i = st.length() - 1; i > 0; i--) {
      if (st[i] < '0') {
        st[i - 1]--;
        st[i] += 10;
      }
    }
    if (st[0] == '0') st.erase(0, 1);
    fnd = 0;
    ans = "";
    dfs(0, 0, 1);
    cout << ans << endl;
  }
  return 0;
}
