#include <bits/stdc++.h>
using namespace std;
bool G[1001][1001];
int b[32];
void addEdge(int i, int j) { G[i][j] = G[j][i] = true; }
int main() {
  int k;
  while (cin >> k) {
    memset(G, 0, sizeof(G));
    memset(b, 0, sizeof(b));
    int temp = k;
    int cnt = 0;
    while (temp) {
      b[cnt++] = temp % 2;
      temp /= 2;
    }
    int mxbit = 0;
    for (int i = 31; i >= 0; i--) {
      if (b[i]) {
        mxbit = i;
        break;
      }
    }
    int layers = mxbit + 2;
    addEdge(1, 3);
    addEdge(1, 4);
    int id = 3;
    int last_id = 3;
    for (int i = 2; i < layers; i++) {
      for (int j = 0; j < i; j++) {
        addEdge(id + j, id + j + i);
        addEdge(id + j, id + i + i);
      }
      id += i;
      last_id = id;
    }
    for (int i = 0; i <= mxbit; i++) {
      if (b[i]) {
        addEdge(last_id + i + 1, 2);
      }
    }
    printf("%d\n", last_id + layers - 1);
    for (int i = 1; i <= last_id + layers - 1; i++) {
      for (int j = 1; j <= last_id + layers - 1; j++) {
        if (G[i][j]) {
          printf("Y");
        } else {
          printf("N");
        }
      }
      printf("\n");
    }
  }
  return 0;
}
