#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using VI = vector<int>;
const int N = 1005;
bool adj[N][N];
inline void add(int u, int v) { adj[u][v] = adj[v][u] = true; }
int main() {
  int k;
  cin >> k;
  if (k == 1) {
    cout << 2 << endl;
    cout << "NY\nYN\n";
    return 0;
  }
  vector<PII> inter;
  add(2, 3);
  int cur = 4;
  vector<VI> layers{{1}};
  vector<bool> jmp{false};
  while (k > 1) {
    jmp.push_back(k & 1);
    layers.push_back({cur, cur + 1});
    cur += 2;
    k /= 2;
  }
  layers.push_back({3});
  jmp.push_back(false);
  int nn = layers.size();
  for (int i = 0; i + 1 < nn; i++) {
    for (int u : layers[i]) {
      for (int v : layers[i + 1]) {
        add(u, v);
      }
    }
  }
  for (int i = 1; i < nn - 1; i++) {
    int s = layers[i][0];
    if (jmp[i]) {
      int len = nn - i;
      while (len > 1) {
        len--;
        add(s, cur);
        s = cur;
        cur++;
      }
      add(s, 2);
    }
  }
  const int n = cur - 1;
  cout << n << endl;
  for (int u = 1; u <= n; u++) {
    for (int v = 1; v <= n; ++v) {
      cout << (adj[u][v] ? 'Y' : 'N');
    }
    cout << '\n';
  }
  return 0;
}
