#include <bits/stdc++.h>
using namespace std;
int n;
int len;
int a[1010][1010];
void gouzao(int pre1, int pre2, int i, int z) {
  if (i == 0) {
    if (len == 0) {
      a[pre1][2] = a[2][pre1] = 1;
      a[pre2][2] = a[2][pre2] = 1;
    } else {
      if (z == 0)
        a[pre1][2] = a[2][pre1] = 1;
      else {
        int t1 = 1 + 2 * (len - z), t2 = t1 + 1;
        a[pre1][t1] = a[t1][pre1] = 1;
        a[pre1][t2] = a[t2][pre1] = 1;
      }
    }
    return;
  }
  if (len == 0) {
    n++;
    a[pre1][n] = a[n][pre1] = 1;
    a[pre2][n] = a[n][pre2] = 1;
    n++;
    a[pre1][n] = a[n][pre1] = 1;
    a[pre2][n] = a[n][pre2] = 1;
    gouzao(n - 1, n, i - 1, z);
  } else {
    n++;
    a[pre1][n] = a[n][pre1] = 1;
    gouzao(n, n, i - 1, z);
  }
}
int main() {
  int k;
  cin >> k;
  int limit = log2(k);
  n = 2;
  len = 0;
  for (int i = limit; i >= 0; i--) {
    if (k & (1 << i)) {
      gouzao(1, 1, len == 0 ? i : len - i - 1, i);
      if (len == 0) len = limit + 1;
    }
  }
  cout << n << endl;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (a[i][j] && i != j)
        cout << 'Y';
      else
        cout << 'N';
    }
    cout << endl;
  }
}
