#include <bits/stdc++.h>
using namespace std;
struct solution_dag {
  vector<vector<int> > v;
  int path_12;
  solution_dag() {
    v = vector<vector<int> >(4);
    v[0].push_back(2);
    v[2].push_back(3);
    v[3].push_back(1);
    path_12 = 3;
  }
  void pow(int P) {
    int A = v[0][0];
    v[0].clear();
    int B = add_node();
    v[0].push_back(B);
    for (int i = 0; i < P; i++) {
      int C = add_node();
      v[B].push_back(C);
      v[C].push_back(A);
    }
    path_12 += 2;
  }
  void plus_k(int k) {
    int A = v[0][0];
    if (path_12 == 3) {
      for (int i = 0; i < k; i++) {
        int temp = add_node();
        v[A].push_back(temp);
        v[temp].push_back(1);
      }
    } else {
      int prev = add_node();
      for (int i = 0; i < k; i++) {
        int temp = add_node();
        v[A].push_back(temp);
        v[temp].push_back(prev);
      }
      for (int i = 0; i < path_12 - 4; i++) {
        int next = add_node();
        v[prev].push_back(next);
        prev = next;
      }
      v[prev].push_back(1);
    }
  }
  int add_node(void) {
    int res = v.size();
    v.push_back(vector<int>());
    return res;
  }
};
const int MX = 1009;
bool ans[MX][MX];
const int LG = 32;
int k_digs[LG];
const int MOD = 7;
int main() {
  ios_base::sync_with_stdio(false);
  cout.tie(NULL);
  int k;
  cin >> k;
  for (int i = 0; i < LG; i++) {
    k_digs[i] = k % MOD;
    k /= MOD;
  }
  int it = LG - 1;
  while (k_digs[it] == 0) {
    it--;
  }
  solution_dag D;
  D.plus_k(k_digs[it] - 1);
  it--;
  while (it >= 0) {
    if (k_digs[it] != 0) {
      D.pow(MOD);
      D.plus_k(k_digs[it]);
    } else {
      D.pow(MOD);
    }
    it--;
  }
  int n = D.v.size();
  cout << n << '\n';
  assert(n <= 1000);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) ans[i][j] = false;
  for (int i = 0; i < n; i++) {
    for (size_t j = 0; j < D.v[i].size(); j++) {
      int k = D.v[i][j];
      ans[i][k] = true;
      ans[k][i] = true;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) cout << (ans[i][j] ? 'Y' : 'N');
    cout << '\n';
  }
  return 0;
}
