#include<bits/stdc++.h>

using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, maxi = INT_MIN, k;
    cin >> n;
    vector < int > v;
    while (n > 0) {
      v.push_back(n % 10);
      n /= 10;

    }
    int s = v.size();
    for (int i = 0; i < s; i++) {
      maxi = max(maxi, v[i]);
    }
    for (int i = s; i >= 0; i--) {
      if (v[i] == maxi) {
        k = i;
        break;
      }
    }
    v.erase(v.begin() + k);
    if (v[s - 2] != 0) {
      for (int i = (s - 2); i >= 0; i--) {
        cout << v[i];
      }
      cout << endl;
    } else if (v[s - 2] == 0) {
      for (int i = (s - 3); i >= 0; i--) {
        cout << v[i];
      }
      cout << endl;
    }
  }
  return 0;
}