{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eFyodor celebrates his birthday today. Before the guests come he decorates a cake with chocolate cream in a special way. At the beginning cake looks like a square divided into \u003cstrong\u003e4\u003c/strong\u003e equal white square parts. Fyodor calls fractalization the following sequence of actions. All the little squares of cake get united into groups of \u003cstrong\u003e2\u003c/strong\u003ex\u003cstrong\u003e2\u003c/strong\u003e so that there are no ungrouped fragments. After that each small square is divided into \u003cstrong\u003e4\u003c/strong\u003e equal squares so that group of \u003cstrong\u003e2\u003c/strong\u003ex\u003cstrong\u003e2\u003c/strong\u003e becomes a group of \u003cstrong\u003e4\u003c/strong\u003ex\u003cstrong\u003e4\u003c/strong\u003e. As the last action \u003cstrong\u003e4\u003c/strong\u003e squares in the middle of each group are filled with chocolate. Fyodor does not stop at one fractalization and repeats it \u003cstrong\u003eN\u003c/strong\u003e times, even when he has to use a microscope. Illustration below shows the initial cake, first fractalization result, and the cake after the fifth fractalization:\u003c/p\u003e\n\n\u003cp\u003e\u003cimg src\u003d\"https://static.e-olymp.com/content/c2/c2113fd09f23064a70b873f6d576ecfc4ba9bf85.jpg\" /\u003e\u003c/p\u003e\n\n\u003cp\u003eNow Fyodor wants to cut pieces of cake with beautiful patterns for guests, but it is difficult to assess beauty of a piece looking at the whole cake. Fyodor wants a program that will quickly show the pattern of rectangular part of the cake.\u003c/p\u003e\n\n\u003cp\u003e\u003ch2\u003eInput\u003c/h2\u003e\u003c/p\u003e\n\n\u003cp\u003eSingle line at the input contains five non-negative integers: \u003cstrong\u003eN\u003c/strong\u003e, \u003cstrong\u003eR_1\u003c/strong\u003e, \u003cstrong\u003eR_2\u003c/strong\u003e, \u003cstrong\u003eC_1\u003c/strong\u003e, \u003cstrong\u003eC_2\u003c/strong\u003e. \u003cstrong\u003eN\u003c/strong\u003e -- the number of fractalization iterations (\u003cstrong\u003eN\u003c/strong\u003e \u003c \u003cstrong\u003e20\u003c/strong\u003e), \u003cstrong\u003eR_1\u003c/strong\u003e and \u003cstrong\u003eR_2\u003c/strong\u003e -- first and last rows, \u003cstrong\u003eC_1\u003c/strong\u003e and \u003cstrong\u003eC_2\u003c/strong\u003e -- first and last columns of the part. Following restrictions are also met: \u003cstrong\u003eR_1\u003c/strong\u003e ≤ \u003cstrong\u003eR_2\u003c/strong\u003e, \u003cstrong\u003eC_1\u003c/strong\u003e ≤ \u003cstrong\u003eC_2\u003c/strong\u003e; \u003cstrong\u003e0\u003c/strong\u003e ≤ \u003cstrong\u003eR_2\u003c/strong\u003e - \u003cstrong\u003eR_1\u003c/strong\u003e, \u003cstrong\u003eC_2\u003c/strong\u003e - \u003cstrong\u003eC_1\u003c/strong\u003e \u003c \u003cstrong\u003e100\u003c/strong\u003e; \u003cstrong\u003e0\u003c/strong\u003e ≤ \u003cstrong\u003eR_1\u003c/strong\u003e, \u003cstrong\u003eR_2\u003c/strong\u003e, \u003cstrong\u003eC_1\u003c/strong\u003e, \u003cstrong\u003eC_2\u003c/strong\u003e \u003c \u003cstrong\u003e2N\u003c/strong\u003e + \u003cstrong\u003e1\u003c/strong\u003e.\u003c/p\u003e\n\n\u003cp\u003e\u003ch2\u003eOutput\u003c/h2\u003e\u003c/p\u003e\n\n\u003cp\u003eOutput should contain \u003cstrong\u003eR_2\u003c/strong\u003e - \u003cstrong\u003eR_1\u003c/strong\u003e + \u003cstrong\u003e1\u003c/strong\u003e lines each containing \u003cstrong\u003eC_2\u003c/strong\u003e - \u003cstrong\u003eC_1\u003c/strong\u003e + \u003cstrong\u003e1\u003c/strong\u003e characters. Each symbol corresponds to a square and should be \u003cstrong\u003e1\u003c/strong\u003e in case it’s filled with chocolate and \u003cstrong\u003e0\u003c/strong\u003e otherwise.\u003c/p\u003e\n\n"}},{"title":"Example","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e1 0 3 0 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0000\n0110\n0110\n0000\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}