#include <bits/stdc++.h>
using namespace std;
bool g[2000][2000] = {0};
int b[30] = {0};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int k, bSize = 0, bit = 1;
  cin >> k;
  while (k) {
    if (k & 1) b[bSize] = bit;
    bit <<= 1;
    k >>= 1;
    bSize++;
  }
  int n = 2, m = 1;
  if (bSize > 1) {
    g[0][n] = g[n][0] = 1;
    g[0][n + 1] = g[n + 1][0] = 1;
    for (int j = 1; j < bSize - 1; j++, n += 2) {
      g[n][n + 2] = g[n + 2][n] = g[n][n + 3] = g[n + 3][n] = 1;
      g[n + 1][n + 2] = g[n + 2][n + 1] = g[n + 1][n + 3] = g[n + 3][n + 1] = 1;
    }
    g[n][1] = g[1][n] = 1;
    g[n + 1][1] = g[1][n + 1] = 1;
    n += 2;
    for (int i = bSize - 2; i > 0; i--, m++) {
      if (b[i]) {
        g[0][n] = g[n][0] = 1;
        for (int j = 1; j < m; j++, n++) g[n][n + 1] = g[n + 1][n] = 1;
        int mm = (m + 1) << 1;
        g[n][mm] = g[mm][n] = 1;
        g[n][mm + 1] = g[mm + 1][n] = 1;
        n++;
      }
    }
    if (b[0]) {
      g[0][n] = g[n][0] = 1;
      for (int j = 1; j < m; j++, n++) g[n][n + 1] = g[n + 1][n] = 1;
      g[n][1] = g[1][n] = 1;
      n++;
    }
  } else {
    g[0][1] = g[1][0] = 1;
  }
  cout << n << '\n';
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (g[i][j])
        cout << "Y";
      else
        cout << "N";
    }
    cout << '\n';
  }
  flush(cout);
  return 0;
}

### Prompt

In CPP, your task is to solve the following problem:

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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
bool g[2000][2000] = {0};
int b[30] = {0};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int k, bSize = 0, bit = 1;
  cin >> k;
  while (k) {
    if (k & 1) b[bSize] = bit;
    bit <<= 1;
    k >>= 1;
    bSize++;
  }
  int n = 2, m = 1;
  if (bSize > 1) {
    g[0][n] = g[n][0] = 1;
    g[0][n + 1] = g[n + 1][0] = 1;
    for (int j = 1; j < bSize - 1; j++, n += 2) {
      g[n][n + 2] = g[n + 2][n] = g[n][n + 3] = g[n + 3][n] = 1;
      g[n + 1][n + 2] = g[n + 2][n + 1] = g[n + 1][n + 3] = g[n + 3][n + 1] = 1;
    }
    g[n][1] = g[1][n] = 1;
    g[n + 1][1] = g[1][n + 1] = 1;
    n += 2;
    for (int i = bSize - 2; i > 0; i--, m++) {
      if (b[i]) {
        g[0][n] = g[n][0] = 1;
        for (int j = 1; j < m; j++, n++) g[n][n + 1] = g[n + 1][n] = 1;
        int mm = (m + 1) << 1;
        g[n][mm] = g[mm][n] = 1;
        g[n][mm + 1] = g[mm + 1][n] = 1;
        n++;
      }
    }
    if (b[0]) {
      g[0][n] = g[n][0] = 1;
      for (int j = 1; j < m; j++, n++) g[n][n + 1] = g[n + 1][n] = 1;
      g[n][1] = g[1][n] = 1;
      n++;
    }
  } else {
    g[0][1] = g[1][0] = 1;
  }
  cout << n << '\n';
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (g[i][j])
        cout << "Y";
      else
        cout << "N";
    }
    cout << '\n';
  }
  flush(cout);
  return 0;
}

```