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.
s, n = 2, 3
mat = [1000*[0] for i in range(1000)]
mat[0][2] = mat[2][0] = 1
k = int(raw_input())

for p in [3, 7, 31, 127, 233]:
  if k % p == 0:
    for i in xrange(s+1, s+p+1):
      mat[s][i] = mat[i][s] = mat[i][s+p+1] = mat[s+p+1][i] = 1
    s += p + 1
    n += p + 1
    k /= p

k = [i[0] for i in enumerate(bin(k)[:1:-1]) if i[1] == '1']
m = max(k)

for ind in k:
  l = n
  r = n + 2*ind
  n = r + m + 1 - ind
  if l < r:
    mat[s][l] = mat[s][l+1] = mat[l][s] = mat[l+1][s] = 1
    for i, j in zip(xrange(l, r-2, 2), xrange(l+1, r-2, 2)):
      mat[i][i+2] = mat[i][j+2] = mat[j][i+2] = mat[j][j+2] = 1
      mat[i+2][i] = mat[j+2][i] = mat[i+2][j] = mat[j+2][j] = 1
    mat[r-2][r] = mat[r-1][r] = mat[r][r-2] = mat[r][r-1] = 1
  else: mat[s][r] = mat[r][s] = 1
  for i in xrange(r, n-1): mat[i][i+1] = mat[i+1][i] = 1
  mat[1][n-1] = mat[n-1][1] = 1

print n
for i in xrange(n):
  print "".join(map(lambda x: "Y" if mat[i][x] == 1 else "N", xrange(n)))