#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
//#define int long long
//#define LL long long
#define double long double
//#define lf Lf
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
#define Gheap priority_queue<int,vector<int>,greater<int>>
#define Lheap priority_queue<int>
#define MAXN 0x3f3f3f3f
#define MINN -0x3f3f3f3f
using namespace std;
//const int N=1e6+100,M=2*N;
//int e[N],w[M],h[M],ne[M],idx;

void solve()
{
    int n;cin>>n;
    char a[n+1];
    unordered_map<int,int> st;
    st[0]=st[n+1]=1;
    int ans=0;
    for(int i=1;i<=n;i++)
    {
    	cin>>a[i];
    	if(a[i]=='1')
    	{
    		if(st[i+1]==1 and st[i-1]==1)
    		{
    			ans+=2;
    		}
    		else
    		{
    			ans++;
    			if(st[i-1]==0) st[i-1]=1;
    			else if(st[i+1]==0) st[i+1]=1;
    		}
    	}
    }
    cout<<ans<<endl;

}

int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt=1;
    cin >> tt;
    while(tt--) solve();
}
/*
1000101111

101010101

01110


*/