#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int INF =0x3f3f3f3f;
const int maxn=100000 ;
char s[maxn+5];
int n;
int ans=0;
int main()
{
while(~scanf("%d",&n))
{
scanf("%s",s+1);
ans=0;
s[0]='@';
int cnt=0;
for(int i=1;i<=n;i++)
{
ans+=s[i]==s[i-1]?0:1;
if(i+1<=n&&s[i]==s[i+1] ) cnt++;
}
if(cnt>=2) cnt=2;
printf("%d\n",ans+cnt);
}
return 0;
}