#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<bits/stdc++.h>
#define wr(a,b) cout << a << " " << b << endl
#define fo(i,a,b) for (int i = a;i <= b;++ i)
#define fd(i,a,b) for (int i = a;i >= b;-- i)


#define int long long
using namespace std;

//#define OWO
#ifdef OWO
#define debug(args...) LKJ("\033[1;32m[ " #args " ]\033[0m", args)
template<class I> void LKJ(I&&x){ cerr << x << '\n'; }
template<class I, class...T> void LKJ(I&&x, T&&...t){ cerr << x << ", ", LKJ(t...); }
template<class I> void OI(I a, I b){while(a < b) cerr << *a << " \n"[a+1 == b], ++a; }
#else
#define debug(...) 0
#define OI(...) 0
#endif


const int N = 1e5 + 10;
int T;
int A[N];
string st[N];
int n,cnt = 0, ans = 0;

void made1(int dt){
    ++cnt;
    fo (i,0,dt-1){
        fo (j,1,A[i]) cout << 'b';
        cout << 'r';
    }
    fo (j,1,A[dt]) cout << 'b';
    cout << '\n';
      OI(A,A+dt+1);
    return;
}

void made2(int dt){
    ++cnt;
    fo (i,0,dt-1){
        fo (j,1,A[i]) st[cnt] +='b';
        st[cnt] +='r';
    }
    fo (j,1,A[dt]) st[cnt] +='b';
    return;
}

void dfs(int w, int dt, int res) {
  if (cnt == 100) return;
  if (w == dt){
    A[w] = res;
    int ANS = 0;
    fo (i,0,dt) 
     for (int j = i + 1;j <= dt;j += 2)
       ANS += (A[i]+1) * (A[j]+1);
    if (ANS==ans){
      made2(dt);
    }
    return;
  }
  fd (i,res,0) {
    A[w]=i;
    dfs(w+1,dt,res-i);
  }
}

void solve()
{
    cin >> n;
  //  wr("----","----------------");
    int a = (n+1)/2, b = (n+2)/2;
    cnt = 0;
    cout << (ans=a * b) << endl;
    if (n >= 200) {
      A[0]=n/2;
      A[1]=n-1-A[0];
      made1(1);
      if (A[0] != A[1]) {
        A[0]--;
        A[1]++;
        made1(1);
        fo (i,0,48) {
          A[1]--;
          A[2]=i;
          made1(2);
          A[0]--;
          A[1]++;
          made1(2);
        }
      }
      else {
        fo (i,0,98) {
          A[0] = n-2-i-A[1];
          A[2] = i;
          made1(2);
        }
      }
      return;
    }
  //  wr("n=",n);
   // wr("ans=", (ans=a * b));
    fo (k,1,n) {
      fo (i,1,n) A[i] = 0;
      //wr("k",k);
      dfs(0,k,n-k);
    }
    sort(st+1,st+1+cnt);
    fo(i,1,cnt) cout << st[i] << endl; 
}

signed main()
{

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    T = 1;
  //  cin >> T;
    while(T--)
    {
        solve();
    }
    
}