#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using edge = pair<int,int>;
using djikstra = priority_queue<edge, vector<edge>, greater<edge>>;
const int INF = 2000000001;
const ll LINF = 9*1e+18;
const int mod = (1e+9)+7;
const int lmod = 998244353;

int gcd(int a, int b){
    if(a%b == 0){
        return b;
    } else {
        return gcd(b, a%b);
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    string s;

    while(n--){
        cin >> s;

        for(int i=0; i<s.size(); i++){
            if(s[i] != '0') {
                cout << s.substr(i, s.size()-i) << endl;
                break;
            }

            if(i == 4) cout << 0 << endl;
        }
    }
}