#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
long long a[maxn][maxn], sl[maxn], b[maxn][maxn];
queue<long long> q;
void pov(long long x, long long y) {
  a[x][y] = 1;
  a[y][x] = 1;
}
int main() {
  long long k, x = 0, n = 1;
  scanf("%I64d", &k);
  if (k == 1) {
    printf("2\nNY\nYN\n");
    return 0;
  }
  while (1 << x <= k) x++;
  x--;
  for (long long i = 1; i <= x + 1; i++) {
    n += 2;
    pov(n - 3, n - 1);
    pov(n - 3, n);
    pov(n - 2, n - 1);
    pov(n - 2, n);
  }
  for (long long i = x + 1; i; i--)
    if (1 & (k >> (i - 1))) {
      long long nc = i << 1;
      n++;
      pov(n, nc);
      for (long long j = i; j <= x; j++) {
        n++;
        pov(n, n - 1);
      }
      q.push(n);
    }
  n++;
  while (!q.empty()) {
    long long c = q.front();
    pov(n, c);
    q.pop();
  }
  for (long long i = 1; i <= n; i++) sl[i] = i;
  sl[2] = n;
  sl[n] = 2;
  for (long long i = 1; i <= n; i++)
    for (long long j = 1; j <= n; j++) b[sl[i]][sl[j]] = a[i][j];
  printf("%I64d\n", n);
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= n; j++)
      if (b[i][j])
        printf("Y");
      else
        printf("N");
    printf("\n");
  }
  return 0;
}
