#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <class T>
ostream& prnt(ostream& out, T v) {
  out << v.size() << '\n';
  for (auto e : v) out << e << ' ';
  return out;
}
template <class T>
ostream& operator<<(ostream& out, vector<T> v) {
  return prnt(out, v);
}
template <class T>
ostream& operator<<(ostream& out, set<T> v) {
  return prnt(out, v);
}
template <class T1, class T2>
ostream& operator<<(ostream& out, map<T1, T2> v) {
  return prnt(out, v);
}
template <class T1, class T2>
ostream& operator<<(ostream& out, pair<T1, T2> p) {
  return out << '(' << p.first << ' ' << p.second << ')';
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << H;
  debug_out(T...);
}
const int N = 1505;
const int GG = 31;
int n, w[N][N], k, d[N];
void add(int a, int b) { w[a][b] = w[b][a] = 1; }
void put_edges(int& last, int nr) {
  add(1, last);
  add(1, last + 1);
  last += 2;
  for (int i = 2; i <= nr; i++) {
    add(last, last - 1);
    add(last, last - 2);
    add(last + 1, last - 1);
    add(last + 1, last - 2);
    last += 2;
  }
  add(last - 1, d[GG - nr]);
  add(last - 2, d[GG - nr]);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> k;
  int last = 3;
  int p = 2;
  for (int i = 1; i <= GG; i++) {
    add(last, p);
    d[i] = last;
    p = last;
    last++;
  }
  if (k % 2 == 1) add(1, d[GG]);
  for (int i = 1; (1 << i) <= k; i++) {
    if (k & (1 << i)) put_edges(last, i);
  }
  cout << last << '\n';
  for (int i = 1; i <= last; i++) {
    for (int j = 1; j <= last; j++) cout << (w[i][j] ? 'Y' : 'N');
    cout << "\n";
  }
}
