t = int(input())
for i in range (0,t):
n = (input())
L = [int(x) for x in n]
while len(L)>1:
index = L.index(min(L))
if(len(L)==2):
print(L[1])
break
elif(len(L)%2==0):
L[index],L[1] = L[1],L[index]
L.pop(len(L)-1)
else:
if(index!=1):
L[index],L[1] = L[1],L[index]
L.pop(len(L)-1)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define superfast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(NULL);
void solve() {
string n;
cin >> n;
if(n.size() == 2) {
cout << n[1] << endl;
}
else {
cout << *min_element(n.begin(), n.end()) << endl;
}
}
int main() {
//freopen("input.in", "rt", stdin);
//freopen("output.out", "wt", stdout);
superfast;
int t;
cin >> t;
while(t--) {
solve();
}
return 0;
}322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |