#include <bits/stdc++.h>
using namespace std;
char grid[1010][1010];
long long ptr[1010];
void add(long long u, long long v) { grid[u][v] = grid[v][u] = 'Y'; }
int main() {
  long long N;
  scanf("%lld", &N);
  for (long long i = 1; i <= 1000; i++)
    for (long long j = 1; j <= 1000; j++) grid[i][j] = 'N';
  long long mx = 0, v = 2;
  for (long long i = 35; i >= 0; i--) {
    if ((N & (1LL << i))) {
      mx = max(mx, i);
      v++;
      add(1, v);
      for (long long j = 1; j <= i; j++) {
        if (i != mx) break;
        ptr[mx - j + 1] = v;
        add(v, v + 1);
        add(v + 1, v + 3);
        add(v, v + 2);
        add(v + 2, v + 3);
        v += 3;
        ptr[mx - j] = v;
      }
      for (long long j = 1; j < 2 * mx - 2 * i; j++) {
        add(v, v + 1);
        v++;
      }
      if (i == mx)
        add(v, 2);
      else
        add(v, ptr[i]);
    }
  }
  cout << v << endl;
  for (long long i = 1; i <= v; i++) {
    for (long long j = 1; j <= v; j++) printf("%c", grid[i][j]);
    printf("\n");
  }
  return 0;
}
