#include <bits/stdc++.h>
using namespace std;
template <class _T>
inline string tostr(const _T& a) {
  ostringstream os("");
  os << a;
  return os.str();
}
bool grid[1010][1010];
int main() {
  int n;
  while (cin >> n) {
    memset(grid, 0, sizeof(grid));
    int layers = 0;
    int aux = n;
    while (aux) {
      layers++;
      aux = aux >> 1;
    }
    if (layers == 1) {
      printf("2\nNY\nYN\n");
      continue;
    }
    layers--;
    int node = 3;
    grid[1][node] = true;
    grid[1][node + 1] = true;
    for (int(i) = (1); (i) < (layers); ++(i)) {
      grid[node][node + 2] = true;
      grid[node][node + 3] = true;
      grid[node + 1][node + 2] = true;
      grid[node + 1][node + 3] = true;
      node += 2;
    }
    cerr << "node"
         << " = " << node << endl;
    ;
    grid[node][2] = true;
    grid[node + 1][2] = true;
    node += 2;
    for (int(i) = (0); (i) < (layers); ++(i)) {
      if (n & (1 << i)) {
        if (i == 0) {
          grid[1][node] = true;
        } else {
          grid[i * 2 + 1][node] = true;
          grid[i * 2 + 2][node] = true;
        }
        for (int(j) = (i + 1); (j) < (layers); ++(j)) {
          grid[node][node + 1] = true;
          node++;
        }
        grid[node][2] = true;
        node++;
      }
    }
    for (int(i) = (1); (i) < (node + 1); ++(i)) {
      grid[i][i] = false;
      for (int(j) = (1); (j) < (node + 1); ++(j)) {
        if (grid[i][j]) grid[j][i] = true;
      }
    }
    cout << (node - 1) << endl;
    for (int(i) = (1); (i) < (node); ++(i)) {
      for (int(j) = (1); (j) < (node); ++(j)) {
        if (grid[i][j])
          printf("Y");
        else
          printf("N");
      }
      puts("");
    }
  }
  return 0;
}
