#include <bits/stdc++.h>
using namespace std;
int main(void) {
  int k;
  cin >> k;
  vector<int> count;
  while (k) {
    count.push_back(k % 10);
    k /= 10;
  }
  vector<vector<char> > board(1000, vector<char>(1000, 'N'));
  int node = 2;
  for (int i = 0; i < count.size(); ++i) {
    if (count[i] == 0) {
      continue;
    }
    vector<int> pre_layer(1, 0);
    for (int j = 0; j < i; ++j) {
      vector<int> cur_layer;
      for (int p = 0; p < 10; ++p) {
        for (int q = 0; q < pre_layer.size(); ++q) {
          board[pre_layer[q]][node] = 'Y';
          board[node][pre_layer[q]] = 'Y';
        }
        cur_layer.push_back(node++);
      }
      pre_layer = cur_layer;
    }
    for (int j = 0; j < count.size() - i - 1; ++j) {
      vector<int> cur_layer(1, node++);
      for (int p = 0; p < pre_layer.size(); ++p) {
        board[pre_layer[p]][node - 1] = 'Y';
        board[node - 1][pre_layer[p]] = 'Y';
      }
      pre_layer = cur_layer;
    }
    vector<int> cur_layer;
    for (int j = 0; j < count[i]; ++j) {
      for (int p = 0; p < pre_layer.size(); ++p) {
        board[pre_layer[p]][node] = 'Y';
        board[node][pre_layer[p]] = 'Y';
      }
      cur_layer.push_back(node++);
    }
    for (int j = 0; j < cur_layer.size(); ++j) {
      board[cur_layer[j]][1] = 'Y';
      board[1][cur_layer[j]] = 'Y';
    }
  }
  cout << node << endl;
  for (int i = 0; i < node; ++i) {
    for (int j = 0; j < node; ++j) {
      cout << board[i][j];
    }
    cout << endl;
  }
  return 0;
}

### Prompt

Your challenge is to write a cpp solution to 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;
int main(void) {
  int k;
  cin >> k;
  vector<int> count;
  while (k) {
    count.push_back(k % 10);
    k /= 10;
  }
  vector<vector<char> > board(1000, vector<char>(1000, 'N'));
  int node = 2;
  for (int i = 0; i < count.size(); ++i) {
    if (count[i] == 0) {
      continue;
    }
    vector<int> pre_layer(1, 0);
    for (int j = 0; j < i; ++j) {
      vector<int> cur_layer;
      for (int p = 0; p < 10; ++p) {
        for (int q = 0; q < pre_layer.size(); ++q) {
          board[pre_layer[q]][node] = 'Y';
          board[node][pre_layer[q]] = 'Y';
        }
        cur_layer.push_back(node++);
      }
      pre_layer = cur_layer;
    }
    for (int j = 0; j < count.size() - i - 1; ++j) {
      vector<int> cur_layer(1, node++);
      for (int p = 0; p < pre_layer.size(); ++p) {
        board[pre_layer[p]][node - 1] = 'Y';
        board[node - 1][pre_layer[p]] = 'Y';
      }
      pre_layer = cur_layer;
    }
    vector<int> cur_layer;
    for (int j = 0; j < count[i]; ++j) {
      for (int p = 0; p < pre_layer.size(); ++p) {
        board[pre_layer[p]][node] = 'Y';
        board[node][pre_layer[p]] = 'Y';
      }
      cur_layer.push_back(node++);
    }
    for (int j = 0; j < cur_layer.size(); ++j) {
      board[cur_layer[j]][1] = 'Y';
      board[1][cur_layer[j]] = 'Y';
    }
  }
  cout << node << endl;
  for (int i = 0; i < node; ++i) {
    for (int j = 0; j < node; ++j) {
      cout << board[i][j];
    }
    cout << endl;
  }
  return 0;
}

```