#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9, maxn = (int)1e5 + 1;
const double eps = (double)1e-8;
const int mod = (int)1000000009;
vector<int> a[10001];
int k, x, y, st[1000], xx, step;
bool b[1001][1001];
int main() {
  cin >> k;
  if (k == 1) {
    cout << 2 << endl;
    cout << "NY" << endl;
    cout << "YN" << endl;
    return 0;
  }
  x = 1;
  while (k >= (1 << x)) x++;
  x--;
  y = 2;
  a[1].push_back(3);
  for (int i = 2; i <= 2 * x - 1; i++) {
    y++;
    a[y].push_back(y + 1);
  }
  y++;
  a[y].push_back(2);
  y++;
  a[1].push_back(y);
  a[y].push_back(a[3][0]);
  for (int i = 1; i <= x - 1; i++) {
    y++;
    a[(i + 1) * 2].push_back(y);
    a[y].push_back(a[(i + 1) * 2 + 1][0]);
  }
  memset((st), 0, sizeof(st));
  ;
  for (int i = 1; i <= 2 * x - 2; i++) {
    y++;
    a[y].push_back(y + 1);
    if (i & 1) st[i / 2] = y;
  }
  y++;
  a[y].push_back(2);
  st[x - 1] = y;
  xx = x;
  x = 0;
  a[0].push_back(1);
  for (;;) {
    x = a[x][0];
    if (x == 2) break;
    if (x != 1 && (x % 2 > 0))
      x = x;
    else {
      if (x == 1)
        step = 0;
      else
        step = (x / 2 - 1);
      if ((k & (1 << step)) > 0) {
        a[x].push_back(st[step]);
        continue;
      }
    }
  }
  cout << y << endl;
  memset((b), 0, sizeof(b));
  ;
  for (int i = 1; i <= y; i++) {
    for (int j = 0; j < a[i].size(); j++) {
      b[i][a[i][j]] = 1;
      b[a[i][j]][i] = 1;
    }
  }
  for (int i = 1; i <= y; i++) {
    for (int j = 1; j <= y; j++) {
      if (b[i][j])
        cout << "Y";
      else
        cout << "N";
    }
    printf("\n");
  }
  return 0;
}
