#include <bits/stdc++.h>   using namespace std;   int main() {     int n;     scanf( %d , &n);     if (n == 1) {       printf( a na nb nb n );     } else if (n == 2) {       printf( aa nbb ncc ndd n );     } else if (n == 3) {       printf( aab n );       printf( ccb n );       printf( baa n );       printf( bcc n );     } else {       char a[4][105];       int i, j;       if (n % 2 == 0) {         a[0][0] =  a ;         a[0][1] =  a ;         a[1][0] =  b ;         a[2][0] =  b ;         a[3][0] =  a ;         a[3][1] =  a ;         a[0][n - 2] = a[0][n - 1] =  y ;         a[1][n - 1] = a[2][n - 1] =  z ;         a[3][n - 2] = a[3][n - 1] =  y ;         for (i = 1;; i += 2) {           a[1][i] = a[1][i + 1] =  g  + ((i / 2) % 2) * 2;           a[2][i] = a[2][i + 1] =  h  + ((i / 2) % 2) * 2;           if (i + 1 == n - 2) break;           a[0][i + 1] = a[0][i + 2] =  m  + ((i / 2) % 2) * 2;           a[3][i + 1] = a[3][i + 2] =  n  + ((i / 2) % 2) * 2;         }       } else {         a[0][0] = a[1][0] =  a ;         a[2][0] = a[2][1] =  b ;         a[3][0] = a[3][1] =  c ;         a[0][n - 1] = a[0][n - 2] =  z ;         a[1][n - 1] = a[1][n - 2] =  y ;         a[2][n - 1] = a[3][n - 1] =  x ;         for (i = 1; i < n - 2; i++) a[0][i] =  g  + (((i - 1) / 2) % 2);         for (i = 1; i < n - 2; i++) a[1][i] =  i  + (((i - 1) / 2) % 2);         for (i = 2; i < n - 1; i++) a[2][i] =  k  + (((i) / 2) % 2);         for (i = 2; i < n - 1; i++) a[3][i] =  n  + (((i) / 2) % 2);       }       a[0][n] = a[1][n] = a[2][n] = a[3][n] =   0 ;       printf( %s n%s n%s n%s n , a[0], a[1], a[2], a[3]);     }     return 0;   }   