#define _GLIBCXX_DEBUG //遅い可能性がある #include #include #include //多倍長 using namespace boost::multiprecision; // 多倍長.型はcpp_int using namespace atcoder; using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define ALL(a) (a).begin(),(a).end() //lower_bound(ALL(a),x) using ll = long long; using P = pair; using VI = vector; using VVI = vector>; int INF = 100100100; const vector dx = {1, 0, -1, 0}; const vector dy = {0, 1, 0, -1}; int depth[110000]; int mxdepth[110000]; void dfs(VVI& G, int v, int p) { for (int u: G[v]) { if (u == p) continue; depth[u] = depth[v] + 1; mxdepth[u] = max(mxdepth[u], depth[u]); dfs(G,u,v); mxdepth[v] = max(mxdepth[v], mxdepth[u]); } } int main() { int n; cin >> n; rep(i,n) { string v; cin >> v; int vn = v.size(); string ans; bool flag = true; rep(j,vn) { if (flag && v[j] == '0') continue; flag = false; ans += v[j]; } if (ans.size() == 0) ans = "0"; cout << ans << endl; } return 0; }