int a[99999],p[]={80,1,-80,-1},e,d,o=-78,c;main(n){scanf("%d",&c);for(c=c*160
-o;o>0|n;e=n?0:e){for(;n&&e++<2;a[o]=d+1)o+=p[d];n=o+p[d=rand()&3]*2;if(n%80<
1|n<0|n>c||a[n])n=e++>99?0,o+=p[(a[o]+1)&3]*2,e=0:0;}for(a[o=c]=1;o>0;a[o]=5,
o+=p[d&3])d=a[o]+1;for(;++e<c;printf(e%80?"%c":"\n","#    ."[a[e]]));}


/*

Labyrinth generator & solver in 4 lines by Hannu Kankaanpää 2000

Compile notes:
------------------
You must set a[0...99999]=e=d=0 if your compiler doesn't do this
automatically.

You may also need
#include<stdio.h>
#include<stdlib.h>
to compile.
------------------

When the program asks you a value, it's the number of rows you want the
labyrinth to have (values 1-600 are good, 600 is a huge maze!).

If you're using dos, type
laby.exe >laby.txt
And you can print your labyrinth in a text file.

Sample output (input value=15):

#.#############################################################################
#...#      .....#         #         #     #    .......#                 #     #
###.### ###.###.### ### ### ### ### # ### # ###.#####.# ######### ##### ### # #
# #...# # #.# #...# #   #   # #   #   #   # # #.....#.# #     #   #   #   # # #
# ###.# # #.# ###.# # ### ### ### ######### # #####.#.# # ### ##### # ### # # #
#   #.#   #.# #...# #     #     #               #...#.# # # #       #   #   # #
# # #.#####.# #.### ######### # ############### #.###.# # # ########### ##### #
# # #.......# #.#             # #   #.........# #...#.#   #       #...#   #   #
# ########### #.############### # ###.#######.# ###.#.### ### #####.#.### #####
#       #     #.......#       # #   #.#...  #.#   #.#...#     #.....#...#     #
# ##### # ### #######.# ####### ### #.#.#.###.### #.###.#######.#######.##### #
#   #   # # #     #...# #   #   #   #.#.#.....#   #...#.#...#...#     #.....# #
##### # # # ### # #.### # # # ### # #.#.####### #####.#.#.#.#.####### #####.# #
#     # # # #   # #...# # # # #   # #.#.# #     #.....#...#.#.......# #...#.# #
# ####### # # ### ###.# # # # # #####.#.# # #####.#########.# #####.# #.#.#.# #
# #         #   # #...#   # #   #.....#.#   #...#.#   #   #.#   #...#...#...# #
# # ########### ###.### ### ### #.#####.# ###.#.#.### # # #.### #.###.####### #
#       #       #...# # #   #   #.#...#.# #...#.#...#   # #...# #.# #.#       #
######### #######.### # # ### ###.#.#.#.# #.###.# #.##### ###.###.# #.####### #
#         #...#...#   # #     # #.#.#...# #.#...# #...#     #.#...# #...#...# #
# #########.#.#.### # # ##### # #.#.#######.#.#######.# ### #.#.### ###.#.#.# #
#   #     #.#...#   #   #...#   #.#.........#.#  .....#   # #...# #...#...#...#
# # # ### #.#############.#.#####.###########.# #.##### # ####### #.#.#######.#
# #   #   #...........#...#.#.....#.....#.....# #.#...# #       #...#.....#...#
# ##### #############.#.###.#.#####.###.#.#######.#.#.##### #####.#######.#.###
#   # #             #.#...#...# #...# #...#.....#...#.....#     #.#     #...# #
### # ##### ### #####.# #.##### #.### #####.###.##### ###.# ### #.##### ##### #
# #       #   # #   #.# #.....# #.#  .......#...#...# #...#   # #.......#     #
# ####### ### ### # #.#######.# #.###.#######.###.#.###.##### # #######.##### #
#           #     #  .........#  .....#      .....#.....#     #        .......#
#############################################################################

*/