Everyone knows that agents in Valorant decide, who will play as attackers, and who will play as defenders. To do that Raze and Breach decided to play tt matches of a digit game…
In each of tt matches of the digit game, a positive integer is generated. It consists of nn digits. The digits of this integer are numerated from 11 to nn from the highest-order digit to the lowest-order digit. After this integer is announced, the match starts.
Agents play in turns. Raze starts. In one turn an agent can choose any unmarked digit and mark it. Raze can choose digits on odd positions, but can not choose digits on even positions. Breach can choose digits on even positions, but can not choose digits on odd positions. The match ends, when there is only one unmarked digit left. If the single last digit is odd, then Raze wins, else Breach wins.
It can be proved, that before the end of the match (for every initial integer with nn digits) each agent has an ability to make a turn, i.e. there is at least one unmarked digit, that stands on a position of required parity.
For each of tt matches find out, which agent wins, if both of them want to win and play optimally.
Input
First line of input contains an integer tt (1≤t≤100)(1≤t≤100) — the number of matches.
The first line of each match description contains an integer nn (1≤n≤103)(1≤n≤103) — the number of digits of the generated number.
The second line of each match description contains an nn-digit positive integer without leading zeros.
Output
For each match print 1, if Raze wins, and 2, if Breach wins.
Example
Input
4
1
2
1
3
3
102
4
2069
Output
2
1
1
2
Note
In the first match no one can make a turn, the only digit left is 2, it’s even, so Breach wins.
In the second match the only digit left is 3, it’s odd, so Raze wins.
In the third match Raze can mark the last digit, after that Breach can only mark 0. 1 will be the last digit left, it’s odd, so Raze wins.
In the fourth match no matter how Raze plays, Breach can mark 9, and in the end there will be digit 0. It’s even, so Breach wins.
题意：有一个n位的数字，Breach只对偶数位进行标记，Raze只对奇数位进行标记（Raze先进行标记）
余下最后一个数，若为奇数Raze获胜输出 1，否则输出2.
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
int n,t;
char a[100000];
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
scanf("%s",a+1);//输入长度为n的字符串，+1是为了使字符串从a[1]开始，这种是字符串，不能循环输入n个数字（这样数与数之间要有空格的）
if(n%2==0)//n为偶数
{
int f=0;//标记
for(int i=2;i<=n;)
{
if((a[i]-'0')%2==0)
{
f=1;
break;
}
else
i+=2;
}
if(f==1)
printf("2\n");
else
printf("1\n");
}
if(n%2!=0)//n为奇数
{
int k=0;//标记
for(int i=1;i<=n;)
{
if((a[i]-'0')%2!=0)
{
k=1;
break;
}
else
i+=2;
}
if(k==1)
printf("1\n");
else
printf("2\n");
}
}
return 0;
}