1-1.cpp

/* 
AUTHOR: Antarikshya Mitra
TIME: 
PROBLEM NO:- 1-1 Div2 A
*/


#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define endl '\n'
const int MOD = 1e9 + 7; 

void solve(string &s)
{
	int n = s.size();
	// O(N) --> For Changing 0s- to max 1s
	int max_ones = 0;
	for(int i=0;i<=n-1;i++)
	{
		if(s[i-1]=='1' && s[i+1]=='1')
			{
				s[i] = '1';
			}
		if(s[i]=='1')
			max_ones++;
	}
	// O(N) --> For Changing to 1s
	int min_ones = max_ones;
	for(int i=1;i<=n-2;i++)
	{
		if(s[i-1]=='1' && s[i+1]=='1')
			{
				s[i] = '0';
				min_ones--;
			}
	}
	cout<<min_ones<<" "<<max_ones<<endl;
	return;
}

int32_t main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
	int t=1;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		string s;
		cin>>s;
		solve(s);
	}	
	return 0;
}