Paint the Map with Stains and Ink

Hanbyeol came across this problem while taking a probability and statistics class.

A map is made of $50\times 50$ cells. The cell in row $i$ and column $j$ is denoted $(i,j)$. If one can move from $(i,j)$ to $(i+1,j)$ and to $(i,j+1)$, how many ways are there to go from $(1,1)$ to $(50,50)$?

Hanbyeol thought this problem was too easy, so she wondered whether it would be fun to add stains and ink to some of the cells so that movement is blocked. She asked her friend Dubyeol to write a problem for her. The process is as follows.

• Dubyeol paints each $(i,j)$ ($1\le i\le 50,\ 1\le j\le 50$) with stain or ink, or leaves it unpainted. Hanbyeol then finds the number of ways to move from $(1,1)$ to $(50,50)$, where cells painted with stain or ink cannot be entered. If $(1,1)$ or $(50,50)$ is painted with stain or ink, the number of ways is 0.

Dubyeol wrote several problems for Hanbyeol, but found out that Hanbyeol kept getting the answers wrong. Not wanting her to be upset, Dubyeol used astrology to learn what answer she would give and decided to paint the map to match it. Painting the map to match that answer was not easy. Let us paint the stains and ink on the map in Dubyeol's place!

The first line contains the integer $K$, the answer Hanbyeol will say.

Print the map Dubyeol makes as 50 lines, each containing 50 integers separated by spaces. The $j$-th integer on the $i$-th line is 1 if stain or ink is painted on the cell in the $i$-th row from the bottom and the $j$-th column from the left, and 0 if nothing is painted there.

The number of ways to reach the destination under the stated conditions for the printed map must be exactly $K$.

$1\le K\le 10^{18}$

The answer to the original problem is $100891344545564193334812497256$.