#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
vector<int> a[N];
int ans[N][N];
int n, k;
vector<int> q;
int qd[N];
int d = 0;
int main() {
  cin >> k;
  n = 2;
  while (k > 1) {
    if (k % 2 == 1) {
      q.push_back(n);
      qd[n] = d;
      k--;
    } else {
      a[n].push_back(n + 1);
      a[n].push_back(n + 2);
      a[n + 1].push_back(n + 3);
      a[n + 2].push_back(n + 3);
      a[n + 1].push_back(n);
      a[n + 2].push_back(n);
      a[n + 3].push_back(n + 1);
      a[n + 3].push_back(n + 2);
      qd[n] = d;
      qd[n + 1] = d + 1;
      qd[n + 2] = d + 1;
      qd[n + 3] = d + 2;
      d += 2;
      n += 3;
      k /= 2;
    }
  }
  a[n].push_back(1);
  a[1].push_back(n);
  for (int i = 0; i < q.size(); i++) {
    int t = q[i];
    for (int j = qd[t]; j < d; j++) {
      n++;
      qd[n] = qd[t] + 1;
      a[n].push_back(t);
      a[t].push_back(n);
      t = n;
    }
    a[t].push_back(1);
    a[1].push_back(t);
  }
  n++;
  for (int i = 1; i < n; i++)
    for (int j = 0; j < a[i].size(); j++)
      if (a[i][j] == 1)
        a[i][j] = 2;
      else if (a[i][j] == 2)
        a[i][j] = 1;
  swap(a[1], a[2]);
  for (int i = 1; i < n; i++)
    for (int j = 0; j < a[i].size(); j++) ans[i][a[i][j]] = 1;
  cout << (n - 1) << endl;
  for (int i = 1; i < n; i++) {
    for (int j = 1; j < n; j++)
      if (ans[i][j])
        printf("Y");
      else
        printf("N");
    cout << endl;
  }
  return 0;
}
