#include <bits/stdc++.h>
bool adj_mat[(1000)][(1000)];
int n;
void add_edge(int i, int j) {
  adj_mat[i][j] = true;
  adj_mat[j][i] = true;
}
int main() {
  int k;
  scanf("%d", &k);
  for (int i = 2; i <= 29; i++) {
    add_edge(i, i + 1);
  }
  add_edge(30, 1);
  int next_vertex = 31;
  for (int i = 0; i < 30; i++, k >>= 1) {
    assert(next_vertex + 2 * i <= (1000));
    if (!(k & 1)) continue;
    if (i == 0) {
      add_edge(0, 2);
      continue;
    }
    add_edge(0, next_vertex);
    add_edge(0, next_vertex + 1);
    for (int j = 0; j < 2 * i - 2; j += 2) {
      add_edge(next_vertex + j, next_vertex + j + 2);
      add_edge(next_vertex + j, next_vertex + j + 3);
      add_edge(next_vertex + j + 1, next_vertex + j + 2);
      add_edge(next_vertex + j + 1, next_vertex + j + 3);
    }
    if (i == 29) {
      add_edge(next_vertex + 2 * i - 2, 1);
      add_edge(next_vertex + 2 * i - 1, 1);
    } else {
      add_edge(next_vertex + 2 * i - 2, i + 2);
      add_edge(next_vertex + 2 * i - 1, i + 2);
    }
    next_vertex = next_vertex + 2 * i;
  }
  assert(next_vertex <= (1000));
  int n = next_vertex;
  printf("%d\n", n);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      putchar(adj_mat[i][j] ? 'Y' : 'N');
    }
    printf("\n");
  }
  return 0;
}
