Fox Ciel wants to write a task for a programming contest. The task is: "You are given a simple undirected graph with n vertexes. Each its edge has unit length. You should calculate the number of shortest paths between vertex 1 and vertex 2."

Same with some writers, she wants to make an example with some certain output: for example, her birthday or the number of her boyfriend. Can you help her to make a test case with answer equal exactly to k?

Input

The first line contains a single integer k (1 ≤ k ≤ 109).

Output

You should output a graph G with n vertexes (2 ≤ n ≤ 1000). There must be exactly k shortest paths between vertex 1 and vertex 2 of the graph.

The first line must contain an integer n. Then adjacency matrix G with n rows and n columns must follow. Each element of the matrix must be 'N' or 'Y'. If Gij is 'Y', then graph G has a edge connecting vertex i and vertex j. Consider the graph vertexes are numbered from 1 to n.

The graph must be undirected and simple: Gii = 'N' and Gij = Gji must hold. And there must be at least one path between vertex 1 and vertex 2. It's guaranteed that the answer exists. If there multiple correct answers, you can output any of them. 

Examples

Input

2

Output

4
NNYY
NNYY
YYNN
YYNN

Input

9

Output

8
NNYYYNNN
NNNNNYYY
YNNNNYYY
YNNNNYYY
YNNNNYYY
NYYYYNNN
NYYYYNNN
NYYYYNNN

Input

1

Output

2
NY
YN

Note

In first example, there are 2 shortest paths: 1-3-2 and 1-4-2.

In second example, there are 9 shortest paths: 1-3-6-2, 1-3-7-2, 1-3-8-2, 1-4-6-2, 1-4-7-2, 1-4-8-2, 1-5-6-2, 1-5-7-2, 1-5-8-2.
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1001;
int n;
int mat[MAX_N][MAX_N];
int vis[101];
vector<int> v;
int cal(int x) {
  int len = 0;
  while (x > 0) {
    vis[len++] = x % 3;
    x /= 3;
  }
  return len;
}
void solve() {
  int num = 3;
  int len = cal(n);
  for (int i = 0; i < len; ++i) {
    if (vis[i] > 0) {
      v.clear();
      if (vis[i] == 1) {
        mat[1][num] = 1;
        v.push_back(num++);
      } else {
        mat[1][num] = 1;
        v.push_back(num++);
        mat[1][num] = 1;
        v.push_back(num++);
      }
      for (int j = 0; j <= i; ++j) {
        for (int k = 0; k < v.size(); ++k) {
          mat[v[k]][num] = mat[v[k]][num + 1] = mat[v[k]][num + 2] = 1;
        }
        v.clear();
        v.push_back(num), v.push_back(num + 1), v.push_back(num + 2);
        num += 3;
      }
      num -= 3;
      for (int j = 1; j < MAX_N; ++j) {
        mat[j][num + 1] = mat[j][num + 2] = 0;
      }
      int j = i + 1;
      while (j < len) {
        mat[num][num + 1] = 1;
        ++num;
        ++j;
      }
      mat[num++][2] = 1;
    }
  }
  --num;
  for (int i = 1; i <= num; ++i) {
    for (int j = 1; j <= num; ++j) {
      if (mat[i][j] == 1) mat[j][i] = 1;
    }
  }
  printf("%d\n", num);
  for (int i = 1; i <= num; ++i) {
    for (int j = 1; j <= num; ++j) {
      if (mat[i][j] == 1)
        cout << "Y";
      else
        cout << "N";
    }
    cout << endl;
  }
}
int main() {
  scanf("%d", &n);
  solve();
  return 0;
}
