#include <bits/stdc++.h>
const int MAXN = (int)1e6 + 123;
const double eps = 1e-6;
const long long INF = 1000000000000000000ll;
using namespace std;
int k, ans[2000][2000], n, now;
vector<int> b;
pair<int, int> lv[40];
int main() {
  ios_base::sync_with_stdio(0);
  cin >> k;
  if (k == 1) {
    cout << "2\nNY\nYN";
    return 0;
  }
  for (int i = 30; i >= 0; i--)
    if ((k & (1 << i)) > 0) b.push_back(i);
  n = 2;
  lv[0].first = lv[0].second = 1;
  for (int i = 1; i <= b[0]; i++) {
    lv[i].first = ++n;
    lv[i].second = ++n;
  }
  lv[b[0] + 1].first = lv[b[0] + 1].second = 2;
  for (int i = 0; i <= b[0]; i++) {
    ans[lv[i].first][lv[i + 1].first] = ans[lv[i + 1].first][lv[i].first] = 1;
    ans[lv[i].first][lv[i + 1].second] = ans[lv[i + 1].second][lv[i].first] = 1;
    ans[lv[i].second][lv[i + 1].first] = ans[lv[i + 1].first][lv[i].second] = 1;
    ans[lv[i].second][lv[i + 1].second] = ans[lv[i + 1].second][lv[i].second] =
        1;
  }
  for (int i = 1; i < b.size(); i++) {
    now = 1;
    for (int j = 1; j <= b[0] - b[i]; j++) {
      n++;
      ans[now][n] = ans[n][now] = 1;
      now = n;
    }
    int id = b[0] - b[i] + 1;
    ans[now][lv[id].first] = ans[lv[id].first][now] = 1;
    ans[now][lv[id].second] = ans[lv[id].second][now] = 1;
  }
  cout << n << endl;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (ans[i][j])
        cout << "Y";
      else
        cout << "N";
    }
    cout << endl;
  }
  return 0;
}
