#include <bits/stdc++.h>
using namespace std;
int E[2005][2005];
vector<int> LAYER[35];
void add_edge(int from, int to) { E[from][to] = E[to][from] = 1; }
int main() {
  int n;
  cin >> n;
  if (n == 1) {
    cout << 2 << endl;
    cout << "NY" << endl;
    cout << "YN" << endl;
    return 0;
  }
  int vertex = 3;
  int source = 1;
  int dest = 2;
  int i;
  int target_dist;
  int layer = 0;
  for (i = 31; i >= 0; i--) {
    if (n & (1 << i)) {
      int aux = i - 1;
      target_dist = i;
      add_edge(source, vertex);
      add_edge(source, vertex + 1);
      while (aux--) {
        add_edge(vertex, vertex + 2);
        add_edge(vertex, vertex + 3);
        add_edge(vertex + 1, vertex + 2);
        add_edge(vertex + 1, vertex + 3);
        vertex += 2;
        LAYER[layer].push_back(vertex);
        LAYER[layer].push_back(vertex + 1);
        layer++;
      }
      add_edge(vertex, dest);
      add_edge(vertex + 1, dest);
      vertex += 2;
      i--;
      break;
    }
  }
  for (; i >= 0; i--) {
    if (n & (1 << i)) {
      add_edge(source, vertex);
      int target_layer = layer - 1;
      int need = (1 << i);
      int pow = 1;
      bool connect_two = false;
      while (true) {
        if (pow == need || (pow << 1) == need) {
          if ((pow << 1) == need) connect_two = true;
          break;
        }
        target_layer--;
        pow <<= 1;
      }
      for (int j = 1; j <= target_layer; j++) {
        add_edge(vertex, vertex + 1);
        vertex++;
      }
      if (connect_two) {
        add_edge(vertex, LAYER[target_layer][0]);
        add_edge(vertex, LAYER[target_layer][1]);
      } else {
        add_edge(vertex, LAYER[target_layer][0]);
      }
      vertex++;
    }
  }
  cout << vertex << endl;
  for (int i = 1; i <= vertex; i++) {
    for (int j = 1; j <= vertex; j++) {
      if (E[i][j])
        cout << 'Y';
      else
        cout << 'N';
    }
    cout << endl;
  }
  return 0;
}
