#include <bits/stdc++.h>
using namespace std;
int n, k;
bool matr[2005][2005];
int main() {
  scanf("%d", &k);
  n = 2;
  int len = 0;
  for (int i = 1, deg = 0; i <= k; i = (i << 1), deg++) {
    if (i & k) len = deg;
  }
  for (int deg = len; deg >= 0; deg--) {
    if (!(k & (1 << deg))) continue;
    if (len > deg) {
      n++;
      matr[1 + 2 * deg][n] = matr[n][1 + 2 * deg] = true;
      for (int j = 0; j < len - deg; j++) {
        n++;
        matr[n][n - 1] = matr[n - 1][n] = true;
      }
      matr[2][n] = matr[n][2] = true;
      n++;
      matr[2 + 2 * deg][n] = matr[n][2 + 2 * deg] = true;
      for (int j = 0; j < len - deg; j++) {
        n++;
        matr[n][n - 1] = matr[n - 1][n] = true;
      }
      matr[2][n] = matr[n][2] = true;
      continue;
    }
    if (deg == 0) {
      if (len >= 1) {
        n++;
        matr[n][1] = matr[1][n] = true;
        for (int j = 0; j < len - 1; j++) {
          n++;
          matr[n][n - 1] = matr[n - 1][n] = true;
        }
        matr[n][2] = matr[2][n] = true;
      } else
        matr[1][2] = matr[2][1] = true;
      continue;
    }
    for (int j = 0; j < 2; j++) {
      n++;
      matr[1][n] = matr[n][1] = true;
    }
    for (int j = 2; j <= deg; j++) {
      n++;
      matr[n - 2][n] = matr[n][n - 2] = true;
      matr[n - 1][n] = matr[n][n - 1] = true;
      n++;
      matr[n - 3][n] = matr[n][n - 3] = true;
      matr[n - 2][n] = matr[n][n - 2] = true;
    }
    for (int j = deg; j <= len; j++) {
      n++;
      matr[n][n - 2] = matr[n - 2][n] = true;
      n++;
      matr[n][n - 2] = matr[n - 2][n] = true;
    }
    matr[n][2] = matr[2][n] = true;
    matr[n - 1][2] = matr[2][n - 1] = true;
  }
  printf("%d\n", n);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (matr[i][j])
        printf("Y");
      else
        printf("N");
    }
    printf("\n");
  }
  return 0;
}
