t=int(input())
for _ in range(t):
n=input()
def solve(n):
if int(n[-1])%2==0:
return 0
if int(n[0])%2==0:
return 1
for i in n:
if int(i)%2==0:
return 2
return -1
print(solve(n))
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int T;
cin>>T;
for(int t=0;t<T;t++){
string s;
cin>>s;
int n=s.size();
int l=int(s[n-1])-48;
if(l%2==0){
cout<<0<<endl;
}else {
int f=int(s[0])-48;
if(f%2==0){
cout<<1<<endl;
}else{
int b=1;
for(int i=0;i<n;i++){
int tmp=int(s[i])-48;
if(tmp%2==0){
b=0;
}
}
if(b==0){
cout<<2<<endl;
}else cout<<-1<<endl;
}
}
}
return 0;
}
770A - New Password | 1646B - Quality vs Quantity |
80A - Panoramix's Prediction | 1354B - Ternary String |
122B - Lucky Substring | 266B - Queue at the School |
1490A - Dense Array | 1650B - DIV + MOD |
1549B - Gregor and the Pawn Game | 553A - Kyoya and Colored Balls |
1364A - XXXXX | 1499B - Binary Removals |
1569C - Jury Meeting | 108A - Palindromic Times |
46A - Ball Game | 114A - Cifera |
776A - A Serial Killer | 25B - Phone numbers |
1633C - Kill the Monster | 1611A - Make Even |
1030B - Vasya and Cornfield | 1631A - Min Max Swap |
1296B - Food Buying | 133A - HQ9+ |
1650D - Twist the Permutation | 1209A - Paint the Numbers |
1234A - Equalize Prices Again | 1613A - Long Comparison |
1624B - Make AP | 660B - Seating On Bus |