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.
import java.io.*;
import java.util.*;

public class CF {

	void solve() {
		int k = in.nextInt();
		int maxBit = 0;
		for (int i = 0; i < 31; i++)
			if (((1 << i) & k) != 0)
				maxBit = i;
//		System.err.println(maxBit);
		ArrayList<Integer> cur1 = new ArrayList<>();
		ArrayList<Integer> cur2 = new ArrayList<>();
		ArrayList<Integer> cur3 = new ArrayList<>();
		int it = 2;
		cur1.add(it++);
		cur2.add(it++);
		cur3.add(it++);
		int MAX = 100;
		boolean[][] g = new boolean[MAX][MAX];
		g[0][2] = g[0][3] = g[0][4] = true;
		for (int i = maxBit - 1; i >= 0; i--) {
			// if (((1<<i)&k) == 0) {
			g[cur1.get(cur1.size() - 1)][it] = true;
			g[cur1.get(cur1.size() - 1)][it + 1] = true;
			g[cur2.get(cur2.size() - 1)][it] = true;
			g[cur2.get(cur2.size() - 1)][it + 1] = true;
			if (((1 << i) & k) != 0) {
				g[cur3.get(cur3.size() - 1)][it] = true;
				g[cur3.get(cur3.size() - 1)][it + 1] = true;
			}
			g[cur3.get(cur3.size() - 1)][it + 2] = true;
			cur1.add(it++);
			cur2.add(it++);
			cur3.add(it++);
			// }
		}
		g[cur1.get(cur1.size() - 1)][1] = true;
		out.println(it);
		for (int i = 0; i < it; i++) {
			for (int j = 0; j < it; j++) {
				if (g[i][j] || g[j][i]) {
					out.print("Y");
				} else {
					out.print("N");
				}
			}
			out.println();
		}
	}

	FastScaner in;
	PrintWriter out;

	void run() {
		in = new FastScaner(System.in);
		out = new PrintWriter(System.out);

		solve();

		out.close();
	}

	void runWithFiles() {
		in = new FastScaner(new File("input.txt"));
		try {
			out = new PrintWriter(new File("output.txt"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		solve();

		out.close();
	}

	public static void main(String[] args) {
		Locale.setDefault(Locale.US);
		new CF().run();
	}

	class FastScaner {
		BufferedReader br;
		StringTokenizer st;

		FastScaner(InputStream is) {
			br = new BufferedReader(new InputStreamReader(is));
		}

		FastScaner(File f) {
			try {
				br = new BufferedReader(new FileReader(f));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				String s = null;
				try {
					s = br.readLine();
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (s == null)
					return null;
				st = new StringTokenizer(s);
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}
	}
}