n=int(input())
for i in range(0,n):
k=int(input())
s=input()
if len(s)==1:
if int(s)%2==0:
print(2)
else:
print(1)
else:
if k%2!=0:
c=0
for i in range(0,k,2):
if int(s[i])%2!=0:
c+=1
if c>=1:
print(1)
else:
print(2)
else:
c=0
for i in range(1,k,2):
if int(s[i])%2==0:
c+=1
if c>=1:
print(2)
else:
print(1)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
int main (){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
string s=" ";
int flag1=0;
int flag2=0;
for(int i=0;i<n;i++){
char c;
cin>>c;
s=s+c;
}
if(n==1){
if((s[1]-'0')%2==0) {cout<<2<<endl;
continue;
}
else{ cout<<1<<endl;
continue;
}
}
for(int i=1;i<=n;i++){
if(i%2==0 && (s[i]-'0')%2==0) flag1=1;
if(i%2==1 && (s[i]-'0')%2==1) flag2=1;
}
if(n&1) {
if(flag2==0) cout<<2<<endl;
else cout<<1<<endl;
}
else {
if(flag1==0) cout<<1<<endl;
else cout<<2<<endl;
}
}
return 0;
}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 |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |