#include <bits/stdc++.h>
using namespace std;
int f[1005][1005];
int main() {
  int k;
  scanf("%d", &k);
  int w[39], cnt = 0;
  while (k) {
    w[cnt++] = k % 2;
    k /= 2;
  }
  f[1][3] = f[3][1] = 1;
  int now = 3;
  for (int i = 1; i < cnt; i++) {
    f[now][now + 1] = f[now + 1][now] = 1;
    f[now][now + 2] = f[now + 2][now] = 1;
    f[now + 1][now + 3] = f[now + 3][now + 1] = 1;
    f[now + 2][now + 3] = f[now + 3][now + 2] = 1;
    now += 3;
  }
  int tmp = now + 1;
  f[now][2] = f[2][now] = 1;
  for (int i = 0; i < (cnt - 2) * 2; i++) {
    f[tmp][tmp + 1] = f[tmp + 1][tmp] = 1;
    tmp++;
  }
  f[tmp][now] = f[now][tmp] = 1;
  int pos = now + 1;
  now = tmp;
  int t = 1;
  for (int i = 0; i < cnt; i++) {
    if (w[i] == 1) {
      f[t * 3][pos] = f[pos][t * 3] = 1;
    }
    t++;
    pos += 2;
  }
  printf("%d\n", now);
  for (int i = 1; i <= now; i++) {
    for (int j = 1; j <= now; j++)
      if (f[i][j])
        printf("Y");
      else
        printf("N");
    puts("");
  }
  return 0;
}
