program raf105;
var
a,i,j,s: integer;
f,st: string;
inA,inB: boolean;
begin
readln(a);
readln(f);
i:=1;
while i < length(f)-1 do
st:= f[i] + f[i+1];
inA:= False;
inB:= False;
for j:=1 to length(st)-1 do
if st[j] = 'a' then inA:= True;
if st[j] = 'b' then inB:= True;
end;
if (not inA) or (not inB) then
if st = 'bb' then
f[i+1]:= 'a'
else
f[i+1]:= 'b';
s:= s+1;
i+= 2;
writeln(s);
for i:=1 to length(f)-1 do
write(f[i],' ');
end.
program raf105;
var
a,i,j,s: integer;
f,st: string;
inA,inB: boolean;
begin
readln(a);
readln(f);
i:=1;
while i < length(f)-1 do
begin
st:= f[i] + f[i+1];
inA:= False;
inB:= False;
for j:=1 to length(st)-1 do
begin
if st[j] = 'a' then inA:= True;
if st[j] = 'b' then inB:= True;
end;
if (not inA) or (not inB) then
if st = 'bb' then
f[i+1]:= 'a'
else
f[i+1]:= 'b';
s:= s+1;
i+= 2;
end;
writeln(s);
for i:=1 to length(f)-1 do
write(f[i],' ');
end.
PascalABC#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cstring>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <climits>typedef unsigned long long ulol;
typedef long double ld;
typedef long long lol;
typedef long int li;#define mp make_pair
#define F first
#define S second
#define sqr(a) ( (a) * (a) )
#define pb push_back
#define INF 999999999
#define ret(a) cout << endl; system("pause"); return(a)
//#define ret(a) return(a)using namespace std;int main()
{
ld x;
cin >> x;
x = ( 8 / sqrt( x ) ) + sqrt(x);
cout << x;
ret(0);
}