#include <bits/stdc++.h>
int mindigit(int n) {
  int resu = 0;
  while (n) {
    resu++;
    n >>= 1;
  }
  return resu;
}
int map[2010][2010];
int main() {
  int tot;
  scanf("%d", &tot);
  int m = mindigit(tot);
  int n = 2;
  memset(map, 0, sizeof(map));
  if (tot == 1) {
    map[1][2] = map[2][1] = 1;
  } else {
    int u = ++n, v = ++n;
    int starter = u;
    for (int i = 1; i <= m - 1; i++) {
      int nu = ++n, nv = ++n;
      map[u][nu] = map[nu][u] = 1;
      map[u][nv] = map[nv][u] = 1;
      map[v][nu] = map[nu][v] = 1;
      map[v][nv] = map[nv][v] = 1;
      u = nu;
      v = nv;
    }
    map[2][u] = map[u][2] = 1;
    map[2][v] = map[v][2] = 1;
    map[1][starter] = map[starter][1] = 1;
    int prev = 1;
    for (int i = m - 2; i >= 0; i--) {
      starter += 2;
      n++;
      map[prev][n] = map[n][prev] = 1;
      prev = n;
      if (tot & (1 << i)) map[starter][prev] = map[prev][starter] = 1;
    }
  }
  printf("%d\n", n);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      printf("%c", "NY"[map[i][j]]);
    }
    printf("\n");
  }
  fclose(stdin);
  fclose(stdout);
  return 0;
}
