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*?
The first line contains a single integer *k* (1 ≤ *k* ≤ 10<sup class="upper-index">9</sup>).
from collections import defaultdict
k=int(input())
mask=0
d=defaultdict(lambda:0)
while(mask<=30):

    if k&(1<<mask):
        d[mask]=1
        ma=mask

    mask+=1

adj=defaultdict(lambda:"N")
currl=1
currvu=3
prevu=[1]
prevl=[]
currvl=4
m=4
while((currl//2)<=ma):
    if d[currl//2]:
        adj[currvu,currvl]="Y"
        adj[currvl, currvu] = "Y"

    for j in prevu:
        adj[currvu, j] = "Y"
        adj[j, currvu] = "Y"

    for j in prevl:
        adj[currvl, j] = "Y"
        adj[j, currvl] = "Y"

    if ((currl+2)//2)<=ma:



        prevu=[currvl+1,currvl+2]

        for j in prevu:
            adj[currvu, j] = "Y"
            adj[j, currvu] = "Y"

        prevl=[currvl+3]
        for j in prevl:
            adj[currvl, j] = "Y"
            adj[j, currvl] = "Y"

        currvu=currvl+4
        currvl=currvu+1
        m=max(m,currvl)

    else:
        break

    currl+=2

adj[2,currvl]="Y"
adj[currvl,2]="Y"
for i in range(1,m+1):
    for j in range(1,m+1):
        print(adj[i,j],end="")

    print()









